You end up in an empty room, with a number of distinctly numbered elevated platforms on the ground; your solely possession is a pebble that may simply be picked up and positioned down. You step on one in all these platforms solely to be teleported to a unique, however comparable room with one other set of distinctly numbered platforms, and after some extra investigation you deduce that there is a complete community of comparable and probably indistinguishable rooms all accessible by these constant one-way teleporters. You hope there’s an exit someplace…

Assuming that this community is finite, and that each room is accessible from each different room (not neccesarily immediately), given sufficient time, ought to it’s attainable so that you can decide whether or not an exit exists with full certainty? If so, how, and if not, why not?

Discussion

This is an authentic puzzle. While I did publish this with the intention of seeing others’ options (I do know there are multiple), I might additionally have an interest to listen to about any solutions for tactics I may enhance the wording of this puzzle, or probably alter it to create a more difficult or attention-grabbing variation.