Monte Carlo Tree Search experiments on chess endings. Implemented in C++ with help of Qt library.
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
src
.cproject
.project
Makefile
QtMCTS.pro
QtMCTS.pro.user
README.md
black_t.txt
config.conf
igre_parse.py
igre_parse_simple.py
loop-graphviz-simple
loop-mcts
loop-mcts-simple
white_t.txt

README.md

About this project

This project was implemented during author's university studies about Monte Carlo tree search (MCTS) [1]. MCTS is a relatively unknown algorithm, that proved itself to be quite appropriate for Go.

The goal of this project was to implement and test MCTS on chess endgames. We were particularly interested in KBNK endgame [2], which is currently to hard to solve without the perfect information.

We were, however, unable to solve KBNK, but we had quite a lot of success with KRK endgame [3], which is slightly easier to solve. No work has been done on this project for about two years, since it author completely changed it's professional/working focus.

Author: Janez Urevc (http://janezurevc.name)
Mentor: Matej Guid (http://www.ailab.si/matej/)

Faculty of computer and information sciences
Artificial Intelligence Laboratory
University of Ljubljana
http://www.fri.uni-lj.si

This project is released under the GNU general public license v3.

Resources

  1. http://www.unimaas.nl/games/files/phd/Chaslot_thesis.pdf
  2. http://www.chesskit.com/training/endgame/KBNk/1/index.php
  3. http://www.chesskit.com/training/endgame/KRk/1/index.php
  4. http://qt-project.org/