Course Project for CS181 (Artificial Intelligence), 23Fall.
Proudly presented to you by Zaizhou Yang, Shengxin Li, Yiang Ju, Zhuo Diao and Guanjie Huang!
- Greedy: Choose the action that could reverse the maximum amount of chess.
- Monte Carlo Tree Search
- Q-Learning with DQN
Run python duel.py, for example:
python duel.py --black greedy --white mouse -v # black is greedy agent, white is mouse agent (controled by human), -v means to show the board