Contributors: Nikhil Bhave, Akshat Singh, Vibodh Nautiyal, Khushi Mehta
Organization: Ashoka University
Description: Project for CS-1104 - Discrete Mathematics
Cops and Robbers is a graph theory problem that comes under the category of pursuit-evasion problems.
- A graph with v vertices and e edges is given
- Two vertices are assigned as the cop node and the robber node respectively
- If after some combination of moves, the cop node and robber node coincide, the cop wins the game and the graph is said to be a cop-win graph
- If it is impossible for the cop to get the robber after any-sequence of moves, the graph is said to be a robber-win graph
- It can safely be assumed that both the cop and the robber will play optimally
Languages: Python3
Primary Development Environment: Linux Ubuntu 19.04
- Ensure that python3 is running on your computer
- Clone the repository onto your remote device
- Install pygame using pip3
- Run the 'game.py' file with python3.