Game tree search algorithms for the game of cops and robber

• Author / Creator

  Moldenhauer, Carsten

• 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.

• Subjects / Keywords

  • Pursuit games
  • Reverse Minimax A*
  • Moving target search
  • Two-Agent IDA*
  • TrailMax
  • Dynamic Abstract TrailMax
  • Cops and robbers
  • Iterative Proof-Number Search

• Graduation date

  Fall 2009

• Type of Item

  Thesis

• Degree

  Master of Science

• DOI

  https://doi.org/10.7939/R3J12X

• License

  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.