Two players play a game. At the start of the game each player secretly chooses an integer; the first player from and the second player from . Then they take alternate turns, starting with the first player. The player, whose turn it is, displays a set of numbers and the other player tells whether their secret number is in the set or not. The player to correctly guess a set with a single number is the winner and the game ends.
Let be the winning probability of the first player assuming both players play optimally. For example and .
You are also given .
Find and give your answer rounded to 8 digits after the decimal point.
Write-up coming later
The complete problem is available here. An approach, code, and answer will be added later.