MinimalChess as an engine to an UCI compatible Chess GUI. Author: Lithander
MinimalChess is a bare-bones (minimal) implementation of a chess engine in C#.
Version 0.2 implements a larger subset of the UCI protocol including the most common time management options. It uses iterative deepening search with alpha-beta pruning and a simple killer-move heuristic and evaluates a position by counting material.
The list of non-features is far larger.
No Bitboards
No Move-Undo
No Quiescence search
No Hash Tables
No Move Ordering
No PST's
[...]
This lack of sophistication makes it a good sparring partner for weak human players like myself and chess programmers who are just starting out. I hope it's fun to play against it. It doesn't intentionally blunder or suffer from bugs. It's just counting material a few plies ahead and if you take care to develop your pieces and maintain a sound position you can win against it even as a beginner.
Version 0.2 implements a larger subset of the UCI protocol including the most common time management options. It uses iterative deepening search with alpha-beta pruning and a simple killer-move heuristic and evaluates a position by counting material.
The list of non-features is far larger.
No Bitboards
No Move-Undo
No Quiescence search
No Hash Tables
No Move Ordering
No PST's
[...]
This lack of sophistication makes it a good sparring partner for weak human players like myself and chess programmers who are just starting out. I hope it's fun to play against it. It doesn't intentionally blunder or suffer from bugs. It's just counting material a few plies ahead and if you take care to develop your pieces and maintain a sound position you can win against it even as a beginner.
Comments
Post a Comment