Article View: gnu.chess
Article #2054Re: CPUs at 30 Ghz in the year 2005
From: liam
Date: Fri, 18 May 2001 19:39
Date: Fri, 18 May 2001 19:39
26 lines
2794 bytes
2794 bytes
In rec.games.chess.politics Dann Corbit <dcorbit@solutionsiq.com> wrote: > <liam@ork.net> wrote in message news:B2bN6.1005$du2.96321@news.shore.net... >> In rec.games.chess.politics Robert Hyatt <hyatt@crafty.cis.uab.edu> wrote: >> > Here is a terrifying thought: If you make the raw assumption that there >> > are 10^50 chess positions possible (this is based on many attempts to >> > find the smallest number of bits necessary to store any legal chess > position >> > plus enpassant status and castling status), then the tablebase generator >> > has an interesting task: >> You don't need to search them all. Once you have a won position, you don't >> need to analyze every position from there. >> For example, give me a "dead" position, a knight up, and it's a >> theoretical win, I can assure you, even if I might not win it against >> Kasparov. > Look a the material tossed out during the Evergreen game. Down considerably > more than a knight at one point. But there were a lot of "connections" occurring at that point between pieces. Hardly a "dead" position. Surely, there's a refined quiescence search algorithm out there that is advanced by this point so that it can be used for this purpose.
Technical Details
Message-ID:
<iUeN6.1044$du2.98936@news.shore.net>Path:
arc1-ca.pugleaf.net!archiver1.sj.google.com!newsfeed.google.com!newsfeed.stanford.edu!canoe.uoregon.edu!arclight.uoregon.edu!newsfeed.mathworks.com!news.shore.net!not-for-mailReferences:
<PnWM6.120400$2_.38189249@news3.rdc1.on.home.com> <9e1g6o$4fs$1@oprah.cc.utexas.edu> <tg8s7fdkj8ln68@corp.supernews.com> <9e1vue$uil$1@juniper.cis.uab.edu> <B2bN6.1005$du2.96321@news.shore.net> <FyeN6.161$b62.1020@client>Show Full Headers
Complete Article Headers
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 1073e8,8df9b986ca792ae5
X-Google-Attributes: gid1073e8,public
X-Google-Thread: f52e8,8df9b986ca792ae5
X-Google-Attributes: gidf52e8,public
X-Google-Thread: 1035ff,8df9b986ca792ae5
X-Google-Attributes: gid1035ff,public
X-Google-Thread: 110df2,8df9b986ca792ae5
X-Google-Attributes: gid110df2,public
X-Google-Thread: 10d71d,8df9b986ca792ae5
X-Google-Attributes: gid10d71d,public
X-Google-ArrivalTime: 2001-05-18 12:40:05 PST
Path: arc1-ca.pugleaf.net!archiver1.sj.google.com!newsfeed.google.com!newsfeed.stanford.edu!canoe.uoregon.edu!arclight.uoregon.edu!newsfeed.mathworks.com!news.shore.net!not-for-mail
Sender: John Smith <lain@nautilus.shore.net>
From: liam@ork.net
Subject: Re: CPUs at 30 Ghz in the year 2005
Newsgroups: gnu.chess,rec.games.chess.analysis,rec.games.chess.computer,rec.games.chess.misc,rec.games.chess.politics
References: <PnWM6.120400$2_.38189249@news3.rdc1.on.home.com> <9e1g6o$4fs$1@oprah.cc.utexas.edu> <tg8s7fdkj8ln68@corp.supernews.com> <9e1vue$uil$1@juniper.cis.uab.edu> <B2bN6.1005$du2.96321@news.shore.net> <FyeN6.161$b62.1020@client>
User-Agent: tin/1.4.2-20000205 ("Possession") (UNIX) (SunOS/5.7 (sun4u))
Lines: 26
Message-ID: <iUeN6.1044$du2.98936@news.shore.net>
Date: Fri, 18 May 2001 19:39:58 GMT
NNTP-Posting-Host: 207.244.124.104
X-Complaints-To: abuse@shore.net
X-Trace: news.shore.net 990214798 207.244.124.104 (Fri, 18 May 2001 15:39:58 EDT)
NNTP-Posting-Date: Fri, 18 May 2001 15:39:58 EDT
Organization: Shore.Net, a PRIMUS Company (info@shore.net)