All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars
 perplexus dot info

 Wreck out! (Posted on 2006-04-03)
Supposing you are in a labyrinth, but you have a map and know where you are, there are many algorithms that will find a way out, if there is one.

Now, imagine you are allowed to wreck walls and make holes in them, so as to pass through. If you wreck enough walls, you are certain to be able to leave the labyrinth!

The problem: find an algorithm that determines the MINIMUM number of walls that should be broken in order to escape. Of course, it should also determine WHICH walls to break!

 See The Solution Submitted by Federico Kereki Rating: 4.1429 (7 votes)

 Subject Author Date Mathematical thoughts Robby Goetschalckx 2006-04-04 04:03:08 How I would do it Tristan 2006-04-04 02:01:26 Solution Bractals 2006-04-03 14:47:02 I think I got it. Jer 2006-04-03 13:24:26 More thoughts e.g. 2006-04-03 12:55:57 thoughts Bob Smith 2006-04-03 12:00:05

 Search: Search body:
Forums (0)