[Event "NC3 2006"] [Site "RedHill, Canberra, Australia"] [Date "2006.08.20"] [Round "2"] [White "TRACE"] [Black "Warp"] [Result "1-0"] 1.Nf3 Nf6 2.d4 e6 3.c4 b6 4.g3 Ba6 5.Qb3 Nc6 6.Nbd2 Na5 7.Qc3 8.c5 Be7 9.e3 Bxf1 10.Kxf1 Qd7 11.a4 Nc6 12.Ne5 Nxe5 13.dxe5 Ng4 14.c6 Qc8 15.h3 Nh6 16.e4 Qa6+ 17.Kg2 Rd8 18.Nb3 dxe4 19.Bxh6 gxh6 20.Nd4 Bc5 21.Nb5 O-O 22.Rhe1 Rd3 23.Qc4 Rd2 24.Re2 Qa5 25.Qxe4 Rc8 26.Qg4+ Kh8 27.Rxd2 Qxd2 28.Qf3 Rf8 29.b3 Qb2 30.Rd1 Qc2 31.Rd7 Bxf2 32.Qc3 Qf5 33.Qd3 Qxd3 34.Rxd3 Bc5 35.Rd7 a6 36.Nd6 cxd6 37.c7 Kg7 38.Rd8 d5 39.Rxf8 Bxf8 40.c8=Q a5 41.h4 Bc5 42.Qd8 Be3 43.h5 Bd4 44.Qf6+ Kf8 45.Qxh6+ Ke7 46.Qf6+ Ke8 1-0
a free WinBoard compliant chess engine written by Ross Boyd in C. Its development started in November 2002 based on Tom Kerrigan's TSCP [1], and was first released in February 2003. TRACE uses standard techniques including iterative deepening, internal iterative deepening, aspiration windows, null move pruning, selective search extensions, a two-tier transposition table, pawn hash table, and 5 man Nalimov endgame tablebases. The evaluation function comprises of numerous evaluation terms, including mobility, king safety, knight outposts [2]. In 2006, along with some search, pruning and evaluation tweaks, late move reductions have been implemented [3].
Table of Contents
Tournaments
TRACE played four Australasian National Computer Chess Championships, where she was third at the NC3 2003, fourth at the NC3 2004, and two times runner-up in NC3 2005 and NC3 2006, where she was very close to win the tournament with draws from Bodo and KnightCap, but lost the last round from Chompster [6]. Further, TRACE played a strong CCT9 in 2007.Selected Games
NC3 2006, round 2, TRACE - Warp [7]See also
Forum Posts
External Links
Chess engine
TRACE Version History
Misc
Branch trace from Wikipedia
Stack trace from Wikipedia » Stack
Trace (psycholinguistics) from Wikipedia
Tracing (software) from Wikipedia
References
What links here?
Up one Level