Document Type

Poster

Abstract

We explore a Cat and Mouse game on graph families by considering varying numbers of cats. Every turn, each cat picks a vertex to check if the mouse is there. After every turn the mouse invisibly moves to an adjacent vertex. The game ends if and when the mouse is caught. Our goal is to minimize the total number of vertices occupied by the cats over all turns, denoted T. We developed several strategies to minimize T. We demonstrate T on graph families including binary trees and complete graphs. We find that placing multiple cats on the same vertex during some turns can be an optimal strategy.

html

Publication Date

2022

Keywords

cat and mouse game

Disciplines

Mathematics

Upload File

wf_yes

Share

COinS