Dungeon Robots Gold
In a dungeon, a robot is trying to find treasure chests.
The robot is programmed to follow this algorithm:
How many places are there in the dungeon such that the robot can never find out even if the treasure is indeed in there?
The answer is 19.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
1 solution
You should add an if-statement in the algorithm here: Q1: "Can you move forward"
S1: "No"
Q2 "Can you move to the right?"
S2(yes): "Turn right, repeat Q2"
S2(no): "Turn left, repeat Q2".
This should render 4 the correct answer. Otherwise (unedited, in particular) the answer is 19.