[Event "NC3 2006"] [Site "RedHill, Canberra, Australia"] [Date "2006.08.20"] [Round "4"] [White "LittleThought"] [Black "Fencer"] [Result "1-0"] 1.e4 Nc6 2.d4 d5 3.exd5 Qxd5 4.Nf3 e6 5.a3 Bd7 6.Nc3 Qa5 7.Bd2 Qf5 8.Nb5 Rc8 9.Bd3 Qg4 10.h3 Qh5 11.g4 Qd5 12.c4 Ne5 13.Nxc7+ Rxc7 14.cxd5 Nxd3+ 15.Kf1 Nxb2 16.Qb3 Nc4 17.Bf4 Na5 18.Qb1 Rc4 19.Ne5 b6 20.Nxd7 Kxd7 21.Qb5+ Kd8 22.Bb8 Rc3 23.Bxa7 Nc4 24.Bxb6+ Nxb6 25.Qxb6+ Kd7 26.Re1 Bd6 27.Qb5+ Ke7 28.dxe6 fxe6 29.Qf5 e5 30.dxe5 Bxa3 31.Qg5+ 1-0
You need to enable Javascript in your browser to edit pages.
help on how to format text
a free UCI compatible chess engine by Nathan Thom, able to play Chess960. LittleThought uses a rotated bitboard based, fully incremental move generator, and applies a PVS based alpha-beta search with several tree shaping and pruning routines, such as singular extensions, late move reductions, and null move pruning, and 4-way probe transposition table with other smaller hash tables for caching calculations of pawns, materials, and evaluation. The killer- and history heuristic as well just in case IID improve move ordering. Up to 8 threads are supported for a YBWC based parallel search [1]. So far, LittleThought played the NC3 2006 Australasian National Computer Chess Championship.
Table of Contents
Selected Games
NC3 2006, round 4, LittleThought - Fencer [3]See also
Forum Posts
External Links
LittleBlitzer Chess Software
References
What links here?
Up one Level