{"version":"1.0","type":"link","title":"Deterministic rendezvous problem - Newikis","description":"The deterministic rendezvous problem is a variant of the rendezvous problem where the players, or robots, must find each other by following a deterministic sequence of instructions. Although each robot follows the same instruction sequence, a unique label assigned to each robot is used for symmetry…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}