Date of Submission
Spring 2016
Academic Programs and Concentrations
Mathematics
Project Advisor 1
Ethan Bloch
Abstract/Artist's Statement
Nowhere To Go is a two player board game played on a graph. The players take turns placing blockers on edges, and moving from vertex to vertex using unblocked edges and unoccupied vertices. A player wins by ensuring their opponent is on a vertex with all blocked edges. This project goes over winning strategies for Player 1 for Nowhere To Go on the standard board and other potential boards.
Access Agreement
Open Access
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.
Recommended Citation
Mcfarland-Drye, Najee Kahil, "Winning Strategies in The Board Game Nowhere To Go" (2016). Senior Projects Spring 2016. 309.
https://digitalcommons.bard.edu/senproj_s2016/309
This work is protected by a Creative Commons license. Any use not permitted under that license is prohibited.