Delicate Brute played an interesting pawn sacrifice against M Chess, but could never convert its temporal advantages into anything concrete. After that, M Chess was in complete command.
Delicate Brute vs. Bebe was a back-and-forth game where Delicate Brute seemingly held the upper hand most of the time. Then, for some strange reason, Delicate Brute refused to play the winning idea of creating a passed queen's rook pawn and actually helped Bebe create counterplay in the form of a Bebe passed king pawn. After that, Bebe was without mercy.
Lachex vs. Delicate Brute was interesting in that White had nearly all its pawns advanced and all its pieces on the first rank at one point. Delicate Brute was unable to cope with all these goings on and was mated in less than 30 moves.
Delicate Brute was doing well as Black in a Petroff Defense against Socrates until 12...g5. Don Beal, the programmer, explained that the machine has no king safety criteria and such moves are the result. Socrates soon thereafter put several pieces en prise enroute to a mating attack.
^Don Beal (1989). Experiments with the Null Move.Advances in Computer Chess 5, a revised version is published (1990) under the title A Generalized Quiescence Search Algorithm. Artificial Intelligence, Vol. 43, No. 1, pp. 85-98
Table of Contents
Delicate Brute,
an experimental chess program by Don Beal written in C, which participated at the ACM 1991 and the WCCC 1992, running on a Sun-4 workstation and about 4K Nodes per second in 1991, and at the WMCCC on a Sun Sparc II with about 10K Nps [1]. Apparently, Delicate Brute used selective search features as introduced by Don Beal [2], such as using the null move in quiescence search [3].
ACM 1991
Excerpt from Danny Kopec, Monroe Newborn, Michael Valvo The 22d Annual ACM International Chess Championship [4] [5]:Round 1
Round 2
Round 3
Round 4
Round 5
External Links
References
What links here?
Up one Level