Questions tagged [josephus-problem]

There are n people standing in a circle. A counter goes clockwise around the circle and repeatedly eliminates every k-th person in the circle, until one person (the winner) remains. Where should you stand initially to become the winner?

Filter by
Sorted by
Tagged with
2
votes
1answer
383 views

What is the solution to the generic round table problem?

This question was asked about a group of people whom a king wishes to play a cruel game with. Going around in a circle, the king kills every other person. The question concerned how one could ...
14
votes
1answer
3k views

How do you solve the circular table problem?

One classic puzzle has many different forms, but the basic strategy is the same. Once upon a time there was a crazy king who had a very wise minister with him. The king had a habit of playing a ...