https://github.com/raylu/kingside
chess AI starter code
https://github.com/raylu/kingside
Last synced: 4 months ago
JSON representation
chess AI starter code
- Host: GitHub
- URL: https://github.com/raylu/kingside
- Owner: raylu
- License: mit
- Created: 2015-05-14T07:58:55.000Z (about 11 years ago)
- Default Branch: master
- Last Pushed: 2017-10-12T17:52:10.000Z (over 8 years ago)
- Last Synced: 2024-06-21T03:15:03.660Z (almost 2 years ago)
- Language: Go
- Homepage:
- Size: 43.9 KB
- Stars: 1
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README
- License: LICENSE
Awesome Lists containing this project
README
KINGSIDE
This is some chess AI starter code. Contained within is a stripped down version
of Donna. What's left is a barebones board representation, a position evaluator
that just counts pieces, and a searcher that always returns the first valid move.
GETTING STARTED
You will need Go v1.3 or later (see https://golang.org/doc/install). Simply run
`make` to build.
Kingside can be used with any chess GUI software that supports UCI protocol
(such as pychess or cutechess). You can also launch kingside as standalone
command-line program and play against it in interactive mode: `./kingside -i`.
NEXT STEPS
1. `git grep TODO`. Implement an evaluator (just add up piece values) and
searcher (negamax: https://en.wikipedia.org/wiki/Minimax). (Ignore the
insufficient material draw todo for now.)
2. Browse https://chessprogramming.wikispaces.com/
3. Implement alpha-beta pruning
4. Implement a better evaluator
5. Implement an opening book using book.go and
https://github.com/michaeldv/donna_opening_books