GitHub - mlennig/final_walls_game: The game of ‘Walls’ is comprised of an NxN board of squares (like chess, for example) and two players (say A and B), where N is odd and greater than 1. Each game is played twice, one time with player A starting the game and another with player B making the first move. The game has a start state, play rules that determine legal moves and an end state. Once a game ends, there is a certain accounting that decides the game result.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 3 Commits
.DS_Store		.DS_Store
.gitattributes		.gitattributes
COEN 352 Final_Project_NK.docx		COEN 352 Final_Project_NK.docx
Mim_Lennig_FinalProject.cpp		Mim_Lennig_FinalProject.cpp
Mim_Lennig_FinalProject.exe		Mim_Lennig_FinalProject.exe
Mim_Lennig_FinalProject_classes.cpp		Mim_Lennig_FinalProject_classes.cpp
Mim_Lennig_FinalProject_classes.hpp		Mim_Lennig_FinalProject_classes.hpp
README_COEN 352 Final_Project_NK.pdf		README_COEN 352 Final_Project_NK.pdf

About

The game of ‘Walls’ is comprised of an NxN board of squares (like chess, for example) and two players (say A and B), where N is odd and greater than 1. Each game is played twice, one time with player A starting the game and another with player B making the first move. The game has a start state, play rules that determine legal moves and an end sta…

assignment cpp fog-of-war game machine-learning optimization-algorithms rule-based