Difference between revisions of "Sapeli"
GerdIsenberg (talk | contribs) (Created page with "'''Home * Engines * Sapeli''' FILE:Sapele Tree Congo Brazzaville.jpg|border|right|thumb|200px| Sapeli Tree <ref>Sapeli Tree, [https://en.wikipedia.org/wik...") |
GerdIsenberg (talk | contribs) |
||
| Line 10: | Line 10: | ||
==[[Board Representation]]== | ==[[Board Representation]]== | ||
* [[Bitboard Board-Definition#CBoardDef|Classical Bitboard Board-Definition]] | * [[Bitboard Board-Definition#CBoardDef|Classical Bitboard Board-Definition]] | ||
| − | * [[Magic Bitboards]] | + | * [[Magic Bitboards#Plain|Plain Magic Bitboards]] |
==[[Search]]== | ==[[Search]]== | ||
* [[Iterative Deepening]] | * [[Iterative Deepening]] | ||
Revision as of 18:47, 15 September 2019
Sapeli Tree [1]
Sapeli,
an UCI compliant, didactic open source chess engine by Toni Helminen, written in C along with some Python and scripts, licensed under the GPL v3.0.
So far, Sapeli has separate routines to search White (max) and Black (min), and rudimentary selectivity without null move pruning.
Contents
Features
Board Representation
Search
- Iterative Deepening
- Alpha-Beta
- Max versus Min
- Late Move Reductions
- One Reply Extensions
- Transposition Table
- Quiescence Search
- MVV/LVA
Evaluation
Misc
Forum Posts
- Sapeli 1.0 - New chess engine by JohnWoe, CCC, April 20, 2019
External Links
Chess Engine
- GitHub - SamuraiDangyo/Sapeli: a chess960 engine
- Sapeli 1.02 64-bit in CCRL 40/40
- Sapeli in CCRL 40/4
Misc
References
- ↑ Sapeli Tree, Pokola, Republic of the Congo, Image by Robert Sharp, February 15, 2008, Sapele from Wikipedia
