After watching The Queen's Gambit on Netflix I got interested in chess. I played a bit against computer programs and it made me curious about writing my own chess engine. This repository and a series of small videos I upload to Youtube after each milestone are documenting my progress.
Stars
53
Forks
6
Watchers
53
Open Issues
1
Overall repository health assessment
No package.json found
This might not be a Node.js project
127
commits
Increased version number and upgraded to .net9 framework
0f31837View on GitHubfixed https://github.com/lithander/MinimalChessEngine/issues/5
efcae33View on GitHubupgraded wac to use the revised wac with 300 positions from https://arasanchess.org/tests.zip
b7942c1View on GitHubVersion 0.6.1 improves mate finding capabilities: Now encoding the mate distance into the checkmate score instead of counting moves in the PV. Shortest mates are preferred over late ones by search. Search doesn't terminate automatically when a mate is found. When the last iteration resulted in a mate the use of null move pruning is vastly reduced. This allows MMC to find the best move (shortest mate) in many more mate puzzles.
e175da0View on GitHubMerge branch 'master' of https://github.com/lithander/MinimalChessEngine
078826fView on GitHub