The tree search game for two players
From MaRDI portal
Publication:5080909
Abstract: We consider a two-player search game on a tree . One vertex (unknown to the players) is randomly selected as the target. The players alternately guess vertices. If a guess is not the target, then both players are informed in which subtree of the target lies. The winner is the player who guesses the target. When both players play optimally, we show that each of them wins with probability approximately . When one player plays optimally and the other plays randomly, we show that the player with the optimal strategy wins with probability between and (asymptotically). When both players play randomly, we show that each wins with probability between and (asymptotically).
Recommendations
- A SEARCH GAME WITH TRAVELING COST ON A TREE
- Game tree algorithms and solution trees
- The game of arboricity
- The game of arboricity
- A search game with one object and two searchers
- scientific article; zbMATH DE number 42543
- Trees and Ehrenfeucht-Fraïssé games
- Two-player tower of Hanoi
- A Game Tree Search by Probability Method
- An Evasion Game on a Finite Tree
Cites work
Cited in
(3)
This page was built for publication: The tree search game for two players
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5080909)