Article View: gnu.chess
Article #3414Re: Unbeatable?
From: Ian Tiberius Miller
Date: Thu, 03 Jul 1997 00:00
Date: Thu, 03 Jul 1997 00:00
14 lines
825 bytes
825 bytes
Shawn Pringle <pringle@castle.uvic.ca> writes: > > Is gnu chess unbeatable? No, you're just not good enough to do it yourself (I infer). Neither am I by the way :) I can get a decent game by limiting its search depth to two moves, although I read recently a recommendation to limit its search time rather than search depth for a fairer end game. -- Ian Miller, Dorset, UK
Technical Details
Message-ID:
<8767usxsvl.fsf@hasn.dra.hmg.gb>Path:
arc1-ca.pugleaf.net!unknown!not-for-mailReferences:
<Pine.A41.3.96.970702111958.75750F-100000@uvaix2e1.comp.UVic.CA>Show Full Headers
Complete Article Headers
X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 10d71d,8477128a7a2eb3ef X-Google-Attributes: gid10d71d,public From: Ian Tiberius Miller <itmiller@dra.hmg.gb.removeme> Subject: Re: Unbeatable? Date: 1997/07/03 Message-ID: <8767usxsvl.fsf@hasn.dra.hmg.gb> X-Deja-AN: 254266885 References: <Pine.A41.3.96.970702111958.75750F-100000@uvaix2e1.comp.UVic.CA> Organization: Defence Research Agency Newsgroups: gnu.chess