GitHub - raylu/kingside: chess AI starter code

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 3 Commits
cmd		cmd
scripts		scripts
.gitignore		.gitignore
LICENSE		LICENSE
Makefile		Makefile
README		README
bitmask.go		bitmask.go
book.go		book.go
data.go		data.go
engine.go		engine.go
engine_repl.go		engine_repl.go
engine_uci.go		engine_uci.go
evaluate.go		evaluate.go
game.go		game.go
generate.go		generate.go
generate_captures.go		generate_captures.go
generate_checks.go		generate_checks.go
generate_evasions.go		generate_evasions.go
generate_moves.go		generate_moves.go
init.go		init.go
move.go		move.go
piece.go		piece.go
position.go		position.go
position_moves.go		position_moves.go
position_targets.go		position_targets.go
search.go		search.go
utils.go		utils.go

Repository files navigation

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