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?