Abstract
dc:description.abstractWe study the pursuit-evasion game of a zombie and a survivor on point visibility graphs of simple polygons. A zombie has one objective: catch a survivor by occupying the vertex occupied by the survivor. On its turn, a zombie can only move on the first edge of a \textit{geodesic} path to the survivor's location. A survivor may choose to move to any vertex adjacent to its current vertex; the objective of the survivor is to survive as long as possible. Both players take turns and have complete information of the graph and each others' position. We consider two variants played on point visibility graphs: the case where edges have Euclidean weight between their endpoints, and the case where all edge weights are one; we denote these graphs as PVGD(P), and $PVG(P)$ respectively. We show that PVGD(P) is a zombie-win graph, and for any spiral polygon Ps, PVG(Ps) is a zombie-win graph.
Degree
thesis:*- Name thesis:degree_name
- Master of Computer Science (M.C.S.)
- Level thesis:degree_level
- Master's
- Discipline thesis:degree_discipline
- Computer Science
- Grantor dc:publisher
- Carleton University
- Year dc:date.issued
- 2022
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Blackman, Christopher Paul
Rights
dc:rights- Statement dc:rights
-
- Copyright © 2022 the author(s). Theses may be used for non-commercial research, educational, or related academic purposes only. Such uses include personal study, research, scholarship, and teaching. Theses may only be shared by linking to Carleton University Institutional Repository and no part may be used without proper attribution to the author. No part may be used for commercial purposes directly or indirectly via a for-profit platform; no adaptation or derivative works are permitted without consent from the copyright owner.
- Language dc:language.iso
- en
Identifiers
dc:identifier.*- OAI identifier oai:identifier
- oai:carleton.scholaris.ca:20.500.14718/42717