God Save the Queen
Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos, Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil Shende

TL;DR
This paper investigates optimal evacuation strategies in a dark room, focusing on saving the queen with prioritized goals, and establishes bounds on evacuation times for various numbers of helpers, improving upon previous results.
Contribution
It introduces a new priority-based evacuation strategy for saving the queen, providing tighter upper and lower bounds on evacuation times for different helper configurations.
Findings
Priority evacuation can be achieved faster than standard methods.
Tighter bounds on evacuation times for two and three helpers.
Lower bounds established for multiple helper scenarios.
Abstract
Queen Daniela of Sardinia is asleep at the center of a round room at the top of the tower in her castle. She is accompanied by her faithful servant, Eva. Suddenly, they are awakened by cries of "Fire". The room is pitch black and they are disoriented. There is exactly one exit from the room somewhere along its boundary. They must find it as quickly as possible in order to save the life of the queen. It is known that with two people searching while moving at maximum speed 1 anywhere in the room, the room can be evacuated (i.e., with both people exiting) in time units and this is optimal~[Czyzowicz et al., DISC'14], assuming that the first person to find the exit can directly guide the other person to the exit using her voice. Somewhat surprisingly, in this paper we show that if the goal is to save the queen (possibly leaving Eva behind to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Search Problems · Artificial Intelligence in Games · Computational Geometry and Mesh Generation
