This preview shows page 1. Sign up to view the full content.
Unformatted text preview: = {h ,s,t i  h G ,s,t i stconn } . (c) The catandmouse game is a game between two players, the cat and the mouse, played on a directed graph G . A single vertex of G is designated the hole, and the cat and mouse are each placed on vertices of G . The players alternate turns, starting with the cat: at each turn, the current player must choose one of the vertices adjacent to his current position. If the cat and mouse ever occupy the same vertex, the cat wins. If the mouse enters the hole he wins. Each game can be encoded by the tuple h G,c,m,h i , meaning the game is played on graph G , the cat starts at vertex c , the mouse starts at vertex m , and the hole is at vertex h . We dene the language cm = {h G,c,m,h i  the cat can force a win in h G,c,m,h i} . 1...
View
Full
Document
 Spring '08
 Sturtivant,C

Click to edit the document details