Duncan't Do It With 13 Bits (not as described anyway)

• To: micromouse@cs.rhul.ac.uk
• Subject: Duncan't Do It With 13 Bits (not as described anyway)
• From: Peter Harrison <pete@cctc.demon.co.uk>
• Date: Wed, 13 Jun 2001 01:32:12 +0100
• In-Reply-To: <d3.161bbdc5.2857f676@cs.com>
• References: <d3.161bbdc5.2857f676@cs.com>

But you are cheating :)

This is not a legal competition maze. Do you have a legal maze that
Duncan cannot solve?


Still, point taken.

While I must confess not to have studied Duncan's method too closely, It
seems that this maze does not break the concept, only the
implementation. Since a wall-follower can solve it, perhaps the first
job of the minimalist solver might be to see if wall following brings
itself back to the start without visiting the middle. In that case, it
would then have to start adding walls.

It is too late for serious thought. Perhaps I will have another look
tomorrow.

Pete
Peter Harrison
http://www.cannock.ac.uk/~peteh

• Duncan't Do It With 13 Bits (not as described anyway)
• From: NickWSmith@cs.com

• Prev: Duncan't Do It With 13 Bits (not as described anyway)
• Next: Duncan can do it (but not as described)
• Index(es):
  • Main
  • Thread