Editing Rendezvous problem (section)

==Deterministic rendezvous problem==
{{main|Deterministic rendezvous problem}}
The '''deterministic rendezvous problem''' is a variant of the rendezvous problem where the players, or ''robots'', must find each other by following a [[determinism#Mathematical models|deterministic]] sequence of instructions. Although each robot follows the same instruction sequence, a unique label assigned to each robot is used for [[symmetry breaking]].<ref>{{cite journal|last1=Ta-Shma|first1=Amnon|last2=Zwick|first2=Uri|author2-link=Uri Zwick|title=Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences|journal=ACM Transactions on Algorithms|date=April 2014|volume=10|issue=3|doi=10.1145/2601068|s2cid=10718957|at=12}}</ref>