Article View: gnu.chess
Article #95Re: GNU Chess wins London computer chess tourney
From: engelhardt
Date: Fri, 21 Aug 1992 08:27
Date: Fri, 21 Aug 1992 08:27
27 lines
1530 bytes
1530 bytes
In article <1992Aug19.203154.9226@visus.com>, nash@visus.com (Richard V. Nash)
writes:
[...]
> This is the position just before c2c1B. My guess as to why GNUchess did this
> is
> because its evaluation function "reasoned" that it was better to go with 3
> bishops against 1 than 2 against 1. If the pawn would have promoted to a
Should be "than 2 against 0", of course.
> queen,
> no doubt it would have been taken by the bishop on a3. As the game went, the
> white bishop moved away.
>
> Sound plausable? Sound like something a silly machine would do?
Yes, it sounds plausible (this was also the suggestion of another poster.) And
it sounds like something only a silly machine would do. I wonder what made GNU
do this. GNU is clearly ahead and even GNU should have no problems in
converting the h-pawns to one (or even two) queens. I'd say get rid of the
Bishop. (Actually I think I would have pushed the h-pawns if I had sufficient
time. If low on time then just c2c1Q, BxQ, BxB)
--- Allan.
Internet: Allan.Engelhardt@nbi.dk | Allan Engelhardt
Technical Details
Message-ID:
<1992Aug21.102758.984@nbivax.nbi.dk>Path:
arc1-ca.pugleaf.net!sparky!uunet!mcsun!sunic!dkuug!uts!nbivax.nbi.dk!engelhardtReferences:
<1992Aug19.142102.982@nbivax.nbi.dk> <1992Aug19.203154.9226@visus.com>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!mcsun!sunic!dkuug!uts!nbivax.nbi.dk!engelhardt From: engelhardt@nbivax.nbi.dk Newsgroups: gnu.chess Subject: Re: GNU Chess wins London computer chess tourney Message-ID: <1992Aug21.102758.984@nbivax.nbi.dk> Date: 21 Aug 92 08:27:58 GMT References: <1992Aug19.142102.982@nbivax.nbi.dk> <1992Aug19.203154.9226@visus.com> Organization: Niels Bohr Institute and Nordita, Copenhagen Lines: 27