I'm implementing a fight club game.
As you may known the fighters stay in a circle and fights with each other.
In each round Tyler Durden randomly select one of the fighters and this fighter must fights with the one on his left. Whoever wins, stays in the circle. The one who loses leaves the circle forever. All fight results are deterministic, the are stored in a 2D table: wins:[n,n]; wins[x,y] = true/false.
The challenge is going on till there is only one person in the circle.
The super wier is the fighter who is the last to stay. How to find all fighters the could possible be super wiers?