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

Home > Algorithms
Wreck out! (Posted on 2006-04-03) Difficulty: 4 of 5
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)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
SolutionMathematical thoughtsRobby Goetschalckx2006-04-04 04:03:08
SolutionHow I would do itTristan2006-04-04 02:01:26
SolutionSolutionBractals2006-04-03 14:47:02
SolutionI think I got it.Jer2006-04-03 13:24:26
Some ThoughtsMore thoughtse.g.2006-04-03 12:55:57
Some ThoughtsthoughtsBob Smith2006-04-03 12:00:05
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (6)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information