25,161
edits
Changes
BP
,Created page with " '''Home * Engines * BP''' '''BP''', (Mulder BP) <br/> a chess program by Robert Cullum. BP was a selective program written in C and..."
'''[[Main Page|Home]] * [[Engines]] * BP'''
'''BP''', (Mulder BP) <br/>
a chess program by [[Robert Cullum]]. BP was a [[Selectivity|selective]] program written in [[C]] and [[x86]] [[Assembly|assembly]] language to run on a [https://en.wikipedia.org/wiki/Compaq_Deskpro_386#Deskpro_386 Compaq 386] [[IBM PC]] or compatible <ref>[https://www.computerhistory.org/chess/doc-431614f6cabbd/ The ACM's Eighteenth North American Computer Chess Championship] from [[The Computer History Museum]]</ref>.
=Descriptions=
==[[WCCC 1989]]==
from the booklet ''Kings Move - Welcome to the 1989 AGT World Computer Chess Championship'' <ref>[https://www.computerhistory.org/chess/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>
BP spends 95% of its time in [[Evaluation|evaluation]] and the rest on [[Move Generation|move generation]] and [[Search|search]]. Because of this, it must do a selective search, to [[Pruning|prune forward]] at every level of the [[Search Tree|search tree]].
==[[ACM 1991]]==
given by [[Garth Courtois Jr.]], who had the opportunity to talk with some programmers during the [[ACM 1991]] <ref>[[Garth Courtois Jr.]] ('''1991'''). ''Where is Computer Chess Going?'' [[ICGA Journal#14_4|ICCA Journal, Vol. 14, No. 4]]</ref>:
BP, in an n-[[Ply|ply]] [[Iterative Deepening|iterative-deepening]] process, does some [[Pruning|forward pruning]] even at ply 1. There are good, interesting, and bad [[Moves|moves]]. Good ones appear to win [[Material|material]]. Interesting ones exchange material, or are the [[Best Move|best move]] in a previous iteration. Bad moves appear to lose material. There is also consideration given to [[Tactics|tactical]] conditions, such as whether there is a [[Pieces|piece]] under attack or if the machine is retreating from [[Check|check]]. At ply 1 during early iterations all possible moves are examined. At ply 1 and 2 the good and interesting moves are fully explored, but the bad moves are pruned at n-2. Near the bottom of the tree some "serious pruning" is enacted. BP has a 65K [[Transposition Table|position table]] and would like to make this larger for endgames. It runs on a 33 MHz [[x86|486]] processor. The iterative deepening goes in steps: 2,4, ... n-2, n. When they announce a 6-ply analysis, it is a pseudo-6 ply of full width. They examine approximately 1600 [[Nodes per Second|nodes/sec]]. Part of the BP philosophy is expressed: "If we [[Parity Pruning|prune]] on a even ply, and omit a good move, it is a shame. If we prune on an odd ply and omit a good move, it is a disaster."
=Tournament Play=
BP played five [[ACM North American Computer Chess Championship|ACM North American Computer Chess Championships]], the [[ACM 1987]], [[ACM 1988]], [[ACM 1989]], [[ACM 1991]] and [[ACM 1993]], as well the [[WCCC 1989]] in [https://en.wikipedia.org/wiki/Edmonton Edmonton], [https://en.wikipedia.org/wiki/Alberta Alberta], [https://en.wikipedia.org/wiki/Canada Canada] <ref>[https://www.game-ai-forum.org/icga-tournaments/program.php?id=358 Mulder BP's ICGA Tournaments]</ref> operated by [[Kevin O’Connell]].
=Selected Games=
[[WCCC 1989]], round 2, [[BP|Mulder BP]] - [[Pandix]] <ref>[https://www.game-ai-forum.org/icga-tournaments/round.php?tournament=14&round=2&id=10 Edmonton 1989 - Chess - Round 2 - Game 10 (ICGA Tournaments)]</ref>
<pre>
[Event "WCCC 1989"]
[Site "Edmonton, Canada"]
[Date "1989.05.28"]
[Round "2"]
[White "Mulder BP"]
[Black "Pandix"]
[Result "1-0"]
1.e4 e5 2.f4 f5 3.exf5 Qh4+ 4.g3 Qe7 5.fxe5 Qxe5+ 6.Qe2 Nc6 7.d4 Qxe2+ 8.Nxe2 d5
9.Bh3 Bd6 10.Nbc3 Nge7 11.Bg5 Nxf5 12.O-O-O Nfxd4 13.Nxd4 Bxh3 14.Rhe1+ Kf7 15.Ndb5
d4 16.Nxd6+ cxd6 17.Nb5 Kg6 18.Bf4 Bg4 19.Rd3 Rae8 20.Rxe8 Rxe8 21.Nxd4 Nxd4 22.Rxd4
Re1+ 23.Kd2 Re2+ 24.Kc3 Rxh2 25.Rxd6+ Kf7 26.Rd2 Rxd2 27.Kxd2 b5 28.b3 h5 29.c4 bxc4
30.bxc4 Be6 31.Kd3 g6 32.a4 Bd7 33.a5 a6 34.Kd4 Kf6 35.Bc7 g5 36.Bd8+ Kf5 37.c5 Bc6
38.Be7 Kg4 39.Ke5 h4 40.gxh4 gxh4 41.Ke6 h3 42.Bd6 Kf3 43.Be5 Kg2 44.Kd6 Bf3 45.c6 h2
46.Bxh2 Kxh2 47.Kd7 Bg4+ 48.Kd8 Bf3 49.c7 Bg4 50.c8=Q Bxc8 51.Kxc8 Kg3 52.Kb7 1-0
</pre>
=External Links=
* [https://www.game-ai-forum.org/icga-tournaments/program.php?id=358 Mulder BP's ICGA Tournaments]
=References=
<references />
'''[[Engines|Up one level]]'''
[[Category:DosEngine]]
