Dappet
Dappet,
the chess program by Dap Hartmann and Peter Kouwenhoven, competing all 18 consecutive Dutch Open Computer Chess Championships from 1981 until 1998. It further participated at the WMCCC 1988 in Almeria, the WCCC 1989 in Edmonton, the 3rd Computer Olympiad 1991, and various Aegon Tournaments. Dappet of the late 80s and 90s was written in Turbo Pascal and Assembler to run on an x86 based IBM PC or compatible. It used a 10x12 board [1]. It did not utilize the Butterfly Heuristic, proposed by Hartmann in conjunction with Butterfly Boards as a pure thought experiment [2].
Description
from the WCCC 1989 booklet [3]:
Dappet uses the NegaScout algorithm enhanced with refutation tables, killer heuristic, history heuristic and transposition tables (700,000 entries) to search the game tree. The strategy used is basically brute force, with selective deepening of forced lines of play. The opening book consists of some 15,000 positions.
Sylkar
At two occasions, the DOCCC 1986 and DOCCC 1994, to even the number of entries, a female version of Dappet was entered, Sylkar for Sylvia and Karin
References
- ↑ Dap Hartmann (2009). A Thesis is more than three unrelated Ideas. Review, ICGA Journal, Vol. 32, No. 2
- ↑ Dap Hartmann (1988). Butterfly Boards. ICCA Journal, Vol. 11, Nos. 2/3, pp. 64-71.
- ↑ Kings Move - Welcome to the 1989 AGT World Computer Chess Championship. Edmonton, Alberta, Canada, Courtesy of Peter Jennings, from The Computer History Museum
