Count a loop you can never see.

One candle at a time. No chalk, no map, no known length. Use switch state as local memory and make every visit count.

Hidden loop awaiting your first prediction.

Predict guess 10

Choose what guess 10 means before probing.

Guess10
Visits0
Found N?
LOCAL VISIBILITYBINARY SWITCH MEMORYUNKNOWN NEXPONENTIAL BOUNDFINAL WRAP COUNTLOCAL VISIBILITYBINARY SWITCH MEMORYUNKNOWN NEXPONENTIAL BOUNDFINAL WRAP COUNT

A changed switch remembers what you cannot mark.

Why does the final return reveal the loop?

The observer can inspect only one candle, but a toggled candle persists as local state. Choose the strongest invariant.

Transfer to any finite loop

Why does doubling help if it does not itself reveal exact N?

Loop field record

Discover the loop, verify the invariant, and solve the transfer challenge.

0 / 2

reasoning checks complete

Super generates helpful tools and automates fact-checking across the internet proactively. If you enjoyed this tool, build your own with Super and share it with a friend.