Difference between revisions of "Bitboard-Chess"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
| Line 17: | Line 17: | ||
* [[Transposition Table]] | * [[Transposition Table]] | ||
* [[Move Ordering]] | * [[Move Ordering]] | ||
| − | * [[History Heuristic]] | + | ** [[MVV-LVA]] |
| + | ** [[History Heuristic]] | ||
* [[Extensions]] | * [[Extensions]] | ||
* [[Reductions]] | * [[Reductions]] | ||
Revision as of 12:46, 24 July 2021
Home * Engines * Bitboard-Chess
Bitboard-Chess,
a WinBoard compliant, didactic open source chess program by Bill Jordan, written in C++ and licensed under the GPL version 3.
Bitboard-Chess is designed to show how a chess engine might work, quite similar to Bills Bare Bones Chess aka Basic-Chess, but using bitboards [1].
Bitboard serialization is done via Matt Taylor's folded BitScan,
but move generation of sliding pieces is done in mailbox manner
iterating over ray directions and pre-calculated target squares.
Contents
Features
Board Representation
Search
- Iterative Deepening
- Alpha-Beta
- Transposition Table
- Move Ordering
- Extensions
- Reductions
- Quiescence Search
Evaluation
See also
Publications
- Bill Jordan (2020). How to Write a Bitboard Chess Engine. amazon
