Game tree search algorithms for the game of cops and robber
Loading...
Date
Author
Institution
http://id.loc.gov/authorities/names/n79058482
Degree Level
Master's
Degree
Master of Science
Department
Department of Computing Science
Supervisor / Co-Supervisor and Their Department(s)
Examining Committee Member(s) and Their Department(s)
Citation for Previous Publication
Link to Related Item
Abstract
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.
Item Type
http://purl.org/coar/resource_type/c_46ec
Alternative
License
Other License Text / Link
This thesis is made available by the University of Alberta Libraries with permission of the copyright owner solely for non-commercial purposes. This thesis, or any portion thereof, may not otherwise be copied or reproduced without the written consent of the copyright owner, except to the extent permitted by Canadian copyright law.
Language
en