DSA Final Project
Chess search solves the following problem: Given Q Queens, R Rooks, B Bishops, N Knights, and K Kings, how many ways are there to put these pieces on a board such that none of them attack each other?
Side-by-side comparison of Dynamic Programming Depth First Search and Brute Force Depth First Search
You must have the SFML dynamic linking library installed, the same ones from the COP Minesweeper Project
To run, navigate to chess-search/cmake-build-debug, and run chess.exe
From there, follow as prompted
If you want to compile on your own and have CLion installed, you can go to "Project from Version Control" and paste the clone link from the GitHub
Here is a video of me running it: https://www.youtube.com/watch?v=1vbt1nU--S4