Revision as of 21:57, 5 March 2020

Tin Woodman ^[1]

Tinman,
a didactic open source chess engine by Mike Leany, written in Rust, compliant to the Chess Engine Communication Protocol. Tinman is licensed under the Mozilla Public License, V. 2.0, and was first released in January 2020 ^[2].

Description

So far, Tinman is quite rudimentary and lacks state of the art search techniques and evaluation terms - and has therefore huge potential to improve further. It represents the board with a little-endian file-rank mapped bitboard definition, and applies Hyperbola Quintessence to determine sliding piece attacks ^[3]. Search is plain alpha-beta with transposition table, check extension and quiescence inside the iterative deepening loop ^[4], considering material and piece-square tables as evaluation terms at the leaves ^[5].

@@ Line 12: / Line 12: @@
 Search is plain [[Alpha-Beta|alpha-beta]] with [[Transposition Table|transposition table]], [[Check Extensions|check extension]] and [[Quiescence Search|quiescence]] inside the [[Iterative Deepening|iterative deepening]] loop <ref>[https://github.com/mikeleany/tinman/blob/master/src/engine/mod.rs tinman/mod.rs at master · mikeleany/tinman · GitHub]</ref>,
 considering [[Material|material]] and [[Piece-Square Tables|piece-square tables]] as evaluation terms at the [[Leaf Node|leaves]] <ref>[https://github.com/mikeleany/tinman/blob/master/src/engine/eval.rs tinman/eval.rs at master · mikeleany/tinman · GitHub]</ref>.
+=See also=
+* [[Zilch]]
+* [[Vapor]]
 =Forum Posts=