Global ETD Search

1	Game tree search algorithms for the game of cops and robber Moldenhauer, Carsten 11 1900 (has links) Moving target search has been given much attention during the last twenty years. It is a game in which multiple pursuers (cops) try to catch an evading agent (robber) and also known as the game of cops and robber. Within this thesis we study a discrete alternating version played on a graph with given initial positions for the cops and the robber, providing a number of results for optimal and sub-optimal approaches to the game. cops and robbers moving target search Two-Agent IDA* Reverse Minimax A* Iterative Proof-Number Search TrailMax Dynamic Abstract TrailMax pursuit games
2	Game tree search algorithms for the game of cops and robber Moldenhauer, Carsten Unknown Date No description available. cops and robbers moving target search Two-Agent IDA* Reverse Minimax A* Iterative Proof-Number Search TrailMax Dynamic Abstract TrailMax pursuit games