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

Home > General
2-way maze (Posted on 2004-11-01) Difficulty: 3 of 5
An Invisible Maze is a square room with a tiled floor, in which the tiles form a grid. You may walk only to adjacent tiles (no diagonal moves). There is a number on the wall for each row and column of tiles. An Invisible Maze can have any numbers on the walls provided that it has at least one True Path. A True Path will take you from the northwest corner to the southeast corner, and the number of tiles you touch in each row and column is equal to the corresponding number on the wall.

There is an NxN tiled Invisible maze that has at least two different True Paths. Minimize N and then, using that N, minimize the sum of all the numbers on the wall.

Important: Two paths are considered the same even if they touch the exact same tiles in a different order.

See The Solution Submitted by Tristan    
Rating: 4.0000 (4 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Question re: 4 X 4 Probably Min | Comment 12 of 21 |
(In reply to 4 X 4 Probably Min by owl)

Owl, I don't understand how either of these can be a path from start to finish,

the top one has four single nodes, if it was a path it can only have 2 at most.

the bottom one cannot be path either, you cannot traverse through each of the squares to get to the end.

  Posted by Juggler on 2004-11-01 23:08:06

Please log in:
Remember me:
Sign up! | Forgot password

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

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