Reshure

• 2010
• Jan
• 31

It’s.. Unreachable?

Now we have done the introduction, let’s go to a maze and (try to) step on every tile. Quite pointless, I know.

Difficulty: Medium

We represent a maze like this:

xxxxxxxxxxxxxxx
x xxx xx xxxxxx
x xxxxxx xxxxxx
x   xx   xxxxxx
xxx    x xxxxxx
xxxexxxxxxxxxxx

Where x is a wall, and e is the entrance. (There is no exit. This is to fool people who come to the maze.)

There is 1 unreachable tile in this maze, as you can see.

In the file: maze.txt (right click -> save as), which is a 20×12 maze, find out how many tiles are unreachable when starting at the entrance (e) at the top.

Click here for the answer…

• Posted by Reshure
• in Programming, Ruby, Problems
• Add a comment