# Questions tagged [reachability]

A puzzle on a discrete system where one has to decide whether a certain system state can be reached through a finite number of steps.

60 questions
Filter by
Sorted by
Tagged with
14k views

### Turn off all lights in a ring-shaped palace

Not a very difficult question, but one I enjoyed nonetheless and wanted to share with the community. You are a servant in a palace. The palace is in the shape of a circle, and you do not know how ...
5k views

### Amnesiac in a ring shaped palace

Related: Turn off all lights in a ring-shaped palace Your boss has trapped you inside a ring-shaped palace, and all you know about the palace is that there are some number* of identical rooms, each ...
• 21.9k
2k views

### Professor Halfbrain and the sum of the digits of all divisors

Yesterday I met professor Halfbrain in the city. The professor looked tired and somewhat exhausted. He told me that he had spent his nights and days with adding up digits of divisors of positive ...
• 45.4k
2k views

### One hundred tiles

One hundred tiles are arranged in a $10 \times 10$ square. Each tile is black on one side and white on the other side. Two types of move are allowed: Flip over all four tiles in any $2 \times 2$ ...
• 2,611
2k views

• 45.4k
283 views

### A final incident in the flea circus: Part 1

The ringmaster of a flea circus draws a square $ABCD$ with corners $A=(+1,+1)$, $B=(+1,-1)$, $C=(-1,+1)$, $D=(-1,-1)$ in the Euclidean plane and picks a point $P$ with integer coordinates outside ...
• 45.4k