SnailChess

Home * Engines * SnailChess

[ Helix pomatia [1] SnailChess,

an experimental WinBoard compliant chess engine by Rasjid Chan with the fame of a slow searcher, written in C, first released in November 1999. SnailChess started as plain alpha-beta searcher, SnailChess 1.07 used NegaScout with transposition table and null move pruning [2], an intermediate SnailSCP was a partial clone of TSCP [3]. The last public SnailChess 4.013 was released in June 2002. Then SnailChess became a testbed for various board representations and move generation techniques, using incremental updated attack tables and various bitboard methods such as rotated and magic bitboards, and applied an iterative search with a stack of structs [4].

1999

2000 …

2005 …

Chess Engine

Misc

References

  1. Picture of Helix pomatia by Jürgen Schoner, May 23, 2005, Snail from Wikipedia
  2. SnailChess ver 1.07 by Rasjid Chan, Winboard Forum, September 28, 2000
  3. SnailChess-new release by Rasjid Chan, Winboard Forum, June 03, 2000
  4. Re: Fastest Magic Move Bitboard Generator ready to use by Rasjid Chan, Winboard Forum, August 28, 2006
  5. Warum können Schnecken über Rasierklingen kriechen, ohne sich zu verletzen?, Kopfball DasErste (German)

Up one level