Compass-free Navigation of Mazes

Phil Scott, Jacques Fleuriot

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

If you find yourself in a corridor of a standard maze, a sure and easy way to escape is to simply pick the left (or right) wall, and then follow it along its twists and turns and around the dead-ends till you eventually arrive at the exit. But what happens when you cannot tell left from right? What if you cannot tell North from South? What if you cannot judge distances, and have no idea what it means to follow a wall in a given direction? The possibility of escape in these circumstances is suggested in the statement of an unproven theorem given in David Hilbert’s celebrated Foundations of Geometry, in which he effectively claimed that a standard maze could be fully navigated using axioms and concepts based solely on the relations of points lying on lines in a specified order. We discuss our algorithm for this surprisingly challenging version of the maze navigation problem, and our HOL Light verification of its correctness from Hilbert’s axioms
Original languageEnglish
Title of host publicationSCSS 2016, 7th International Symposium on Symbolic Computation in Software Science
EditorsJames H Davenport, Fadoua Ghourabi
PublisherEasyChair
Pages143-155
Number of pages13
Volume39
Publication statusPublished - 2016
Event7th International Symposium on Symbolic Computation in Software Science - Tokyo, Japan
Duration: 28 Mar 201631 Mar 2016

Publication series

NameEPiC Series in Computing
Volume39

Conference

Conference7th International Symposium on Symbolic Computation in Software Science
Abbreviated titleSCSS 2016
Country/TerritoryJapan
CityTokyo
Period28/03/1631/03/16

Keywords / Materials (for Non-textual outputs)

  • formalized mathematics
  • geometry
  • interactive theorem proving

Fingerprint

Dive into the research topics of 'Compass-free Navigation of Mazes'. Together they form a unique fingerprint.

Cite this