Hi,
This is a class project for Theory of Computer Games.
Most of the code is written by myself or modified from the files provided by TA.
If you want know about the algorithm I used in the code, here is the textbook we used in class
Textbook: Computers and Classical Board Games An Introduction, by Tsan-sheng Hsu, Shun-Chin Hsu, Jr-Chang Chen, Yi-Ting Chiang, Bo-Nian Chen, Yun-Ching Liu, Hung-Jui Chang, Sue-Chen Tsai, Ting-Yu Lin and Gang-Yu Fang, National Taiwan University Press, June 2017, ISBN: 978-986-350-237-1.
The algorithm I use for the ply generation is NegaMax and NegaScout algorithm with Iterative Deepening.
Hi, This is a class project for Theory of Computer Games. Most of the code is written by myself or modified from the files provided by TA.
If you want know about the algorithm I used in the code, here is the textbook we used in class Textbook: Computers and Classical Board Games An Introduction, by Tsan-sheng Hsu, Shun-Chin Hsu, Jr-Chang Chen, Yi-Ting Chiang, Bo-Nian Chen, Yun-Ching Liu, Hung-Jui Chang, Sue-Chen Tsai, Ting-Yu Lin and Gang-Yu Fang, National Taiwan University Press, June 2017, ISBN: 978-986-350-237-1.
The algorithm I use for the ply generation is NegaMax and NegaScout algorithm with Iterative Deepening.