  Consider a group of autonomous mobile computational entities, called agents,
arbitrarily placed at some nodes of a dynamic but always connected ring. The
agents neither have any knowledge about the size of the ring nor have a common
notion of orientation. We consider the \textsc{Exploration} problem where the
agents have to collaboratively to explore the graph and terminate, with the
requirement that each node has to be visited by at least one agent. It has been
shown by Di Luna et al. [Distrib. Comput. 2020] that the problem is solvable by
two anonymous agents if there is a single observably different node in the ring
called landmark node. The problem is unsolvable by any number of anonymous
agents in absence of a landmark node. We consider the problem with
non-anonymous agents (agents with distinct identifiers) in a ring with no
landmark node. The assumption of agents with distinct identifiers is strictly
weaker than having a landmark node as the problem is unsolvable by two agents
with distinct identifiers in absence of a landmark node. This setting has been
recently studied by Mandal et al. [ALGOSENSORS 2020]. There it is shown that
the problem is solvable in this setting by three agents assuming that they have
edge crossing detection capability. Edge crossing detection capability is a
strong assumption which enables two agents moving in opposite directions
through an edge in the same round to detect each other and also exchange
information. In this paper we give an algorithm that solves the problem with
three agents without the edge crossing detection capability.
