25,161
edits
Changes
Created page with "'''Home * Engines * Dappet''' '''Dappet''',<br/> the chess program by Dap Hartmann and Peter Kouwenhoven, competing all 18 consecutive Dutch Open..."
'''[[Main Page|Home]] * [[Engines]] * Dappet'''
'''Dappet''',<br/>
the chess program by [[Dap Hartmann]] and [[Peter Kouwenhoven]], competing all 18 consecutive [[Dutch Open Computer Chess Championship|Dutch Open Computer Chess Championships]] from [[DOCCC 1981|1981]] until [[DOCCC 1998|1998]]. It further participated at the [[WMCCC 1988]] in [https://en.wikipedia.org/wiki/Almer%C3%ADa Almeria], the [[WCCC 1989]] in [https://en.wikipedia.org/wiki/Edmonton Edmonton], the [[3rd Computer Olympiad#Chess|3rd Computer Olympiad 1991]], and various [[Aegon Tournaments]]. Dappet of the late 80s and 90s was written in [[Pascal#TurboPascal|Turbo Pascal]] and [[Assembly|Assembler]] to run on an [[x86]] based [[IBM PC]] or compatible. It used a [[10x12 Board|10x12 board]] <ref>[[Dap Hartmann]] ('''2009'''). ''A Thesis is more than three unrelated Ideas''. Review, [[ICGA Journal]], Vol. 32, No. 2</ref>. It did not utilize the [[Butterfly Heuristic]], proposed by Hartmann in conjunction with [[Butterfly Boards]] as a pure thought experiment <ref>[[Dap Hartmann]] ('''1988'''). ''Butterfly Boards''. [[ICGA Journal|ICCA Journal]], Vol. 11, Nos. 2/3, pp. 64-71. </ref>.
=Description=
from the [[WCCC 1989]] booklet <ref>[http://www.computerhistory.org/chess/full_record.php?iid=doc-434fea055cbb3 Kings Move - Welcome to the 1989 AGT World Computer Chess Championship.] Edmonton, Alberta, Canada, Courtesy of [[Peter Jennings]], from [[The Computer History Museum]]</ref>:
Dappet uses the [[NegaScout]] algorithm enhanced with [[Refutation Table|refutation tables]], [[Killer Heuristic|killer heuristic]], [[History Heuristic|history heuristic]] and [[Transposition Table|transposition tables]] (700,000 entries) to search the [[Search Tree|game tree]]. The strategy used is basically [[Brute-Force|brute force]], with [[Extensions|selective deepening]] of forced lines of play. The [[Opening Book|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=
<references />
'''[[Engines|Up one Level]]'''
'''Dappet''',<br/>
the chess program by [[Dap Hartmann]] and [[Peter Kouwenhoven]], competing all 18 consecutive [[Dutch Open Computer Chess Championship|Dutch Open Computer Chess Championships]] from [[DOCCC 1981|1981]] until [[DOCCC 1998|1998]]. It further participated at the [[WMCCC 1988]] in [https://en.wikipedia.org/wiki/Almer%C3%ADa Almeria], the [[WCCC 1989]] in [https://en.wikipedia.org/wiki/Edmonton Edmonton], the [[3rd Computer Olympiad#Chess|3rd Computer Olympiad 1991]], and various [[Aegon Tournaments]]. Dappet of the late 80s and 90s was written in [[Pascal#TurboPascal|Turbo Pascal]] and [[Assembly|Assembler]] to run on an [[x86]] based [[IBM PC]] or compatible. It used a [[10x12 Board|10x12 board]] <ref>[[Dap Hartmann]] ('''2009'''). ''A Thesis is more than three unrelated Ideas''. Review, [[ICGA Journal]], Vol. 32, No. 2</ref>. It did not utilize the [[Butterfly Heuristic]], proposed by Hartmann in conjunction with [[Butterfly Boards]] as a pure thought experiment <ref>[[Dap Hartmann]] ('''1988'''). ''Butterfly Boards''. [[ICGA Journal|ICCA Journal]], Vol. 11, Nos. 2/3, pp. 64-71. </ref>.
=Description=
from the [[WCCC 1989]] booklet <ref>[http://www.computerhistory.org/chess/full_record.php?iid=doc-434fea055cbb3 Kings Move - Welcome to the 1989 AGT World Computer Chess Championship.] Edmonton, Alberta, Canada, Courtesy of [[Peter Jennings]], from [[The Computer History Museum]]</ref>:
Dappet uses the [[NegaScout]] algorithm enhanced with [[Refutation Table|refutation tables]], [[Killer Heuristic|killer heuristic]], [[History Heuristic|history heuristic]] and [[Transposition Table|transposition tables]] (700,000 entries) to search the [[Search Tree|game tree]]. The strategy used is basically [[Brute-Force|brute force]], with [[Extensions|selective deepening]] of forced lines of play. The [[Opening Book|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=
<references />
'''[[Engines|Up one Level]]'''
