Is there a universal, deterministic sequence of actions that can solve any maze, assuming that the actions are applied blindly with no sensor feedback? According to the recent paper Universal Plans: One Action Sequence to Solve Them All! by Kalle G. Timperi, Alexander J. LaValle, and Steven M. LaValle, the answer is “yes”. Even better, the universal seq…
Keep reading with a 7-day free trial
Subscribe to A Piece of the Pi: mathematics explained to keep reading this post and get 7 days of free access to the full post archives.