Thread View: net.games.chess
5 messages
5 total messages
Started by Bruce T. Lowerre
Sat, 14 Dec 1985 00:59
computer chess
Author: Bruce T. Lowerre
Date: Sat, 14 Dec 1985 00:59
Date: Sat, 14 Dec 1985 00:59
16 lines
1462 bytes
1462 bytes
In case you haven't seen it, there was an article in the October 28 issue of Time about the latest computer chess machine, Hitech. This machine was developed at Carnegie-Mellon University by Hans Berliner (a computer science professor who is also a grand master level player and former world correspondence champion) and Carl Ebeling who developed the special purpose chip that is used. The machine is currently rated at about 2250 which is master level but Hans feels its actual rating is about 2500. The machine will be entered in more turnaments to determine its actual rating and to find the level of player that can consistently beat it. In the mean time, its weaknesses are being patched. As Levy says in the article, "In the past, chess players came to laugh. Next year they will be coming to watch. Soon they'll be coming to learn."
Re: computer chess
Author: Dave Trissel
Date: Thu, 19 Dec 1985 08:39
Date: Thu, 19 Dec 1985 08:39
24 lines
2006 bytes
2006 bytes
In article <3199@hplabsb.UUCP> bl@hplabsb.UUCP (Bruce T. Lowerre) writes:
>In case you haven't seen it, there was an article in the October
>28 issue of Time about the latest computer chess machine, Hitech.
>
>The machine is currently rated at about 2250 which is master level
>but Hans feels its actual rating is about 2500. The machine will
>be entered in more turnaments to determine its actual rating and
>to find the level of player that can consistently beat it. In
>the mean time, its weaknesses are being patched.
>
I find the 2500 claim a little hard to believe. As the ratings get higher
the more chess knowlege is required to be embedded in the program. (Just
examine how large the opening libraries have grown from year to year in the
best programs.) And, after leaving opening book the more chess knowlege
embedded in the evaluation algorithms the slower which means fewer moves
examined which leads to weak tactical play blundering.
One obvious method of attack is to so specialize the program that it has
a well defined goal decided at the time of exit from the opening book.
But this would take a substantial effort and the results would still be
inflexible. Anyone know any details of Hans system?
Skeptically - Dave Trissel {ihnp4,seismo}!ut-sally!im4u!oakhill!davet
Re: computer chess
Author: Eli Liang
Date: Fri, 20 Dec 1985 15:47
Date: Fri, 20 Dec 1985 15:47
38 lines
2499 bytes
2499 bytes
In article <623@oakhill.UUCP> davet@oakhill.UUCP (Dave Trissel) writes:
>In article <3199@hplabsb.UUCP> bl@hplabsb.UUCP (Bruce T. Lowerre) writes:
>>In case you haven't seen it, there was an article in the October
>>28 issue of Time about the latest computer chess machine, Hitech.
>>
>>The machine is currently rated at about 2250 which is master level
>>but Hans feels its actual rating is about 2500. The machine will
>>be entered in more turnaments to determine its actual rating and
>>to find the level of player that can consistently beat it. In
>>the mean time, its weaknesses are being patched.
>>
>
>I find the 2500 claim a little hard to believe. As the ratings get higher
>the more chess knowlege is required to be embedded in the program. (Just
>examine how large the opening libraries have grown from year to year in the
>best programs.) And, after leaving opening book the more chess knowlege
>embedded in the evaluation algorithms the slower which means fewer moves
>examined which leads to weak tactical play blundering.
>
>One obvious method of attack is to so specialize the program that it has
>a well defined goal decided at the time of exit from the opening book.
>But this would take a substantial effort and the results would still be
>inflexible. Anyone know any details of Hans system?
>
>Skeptically - Dave Trissel {ihnp4,seismo}!ut-sally!im4u!oakhill!davet
On the other hand, who would know better than a rated GM... Think
Hitech beats Berliner at games?
-eli
--
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Eli Liang ---
University of Maryland Computer Vision Lab, (301) 454-4526
ARPA: eli@cvl, eli@lemuria, eli@mit-mc, eli@mit-prep
CSNET: eli@cvl UUCP: {seismo,allegra,brl-bmd}!umcp-cs!cvl!eli
Re: Re: computer chess
Author: Patrick McGehearty
Date: Fri, 20 Dec 1985 18:28
Date: Fri, 20 Dec 1985 18:28
21 lines
1637 bytes
1637 bytes
> Anyone know any details of Hans system?
>
> Skeptically - Dave Trissel {ihnp4,seismo}!ut-sally!im4u!oakhill!davet
HiTech is discussed in the Winter 1985 issue of Carnegie-Mellon Magazine
(an alumni mag). The following quotes are out of context...
ability to consider 175,000 positions per second
Carl Ebeling has designed a "smart" VLSI "move generator" that
accounts for much of the performance of HiTech.
64 custom chips are used in HiTech/ one per square
Each chip "identifies all moves that can bring any piece to
its square and evaluates them based on the computer's knowledge
of fundamentals of chess strategy"
...a sophisticated analysis program developed by Berliner decides
how things stand in any board position before starting a search...
In summary, HiTech is a smart, brute force program
Having know Hans personally, I would expect him not to exaggerate
with respect to chess performance. After all, the program has
beat two masters and drawn to a third. Best performance ever
by a machine against human players.
Re: computer chess
Author: bl
Date: Thu, 02 Jan 1986 18:13
Date: Thu, 02 Jan 1986 18:13
45 lines
3051 bytes
3051 bytes
> In article <623@oakhill.UUCP> davet@oakhill.UUCP (Dave Trissel) writes:
> >In article <3199@hplabsb.UUCP> bl@hplabsb.UUCP (Bruce T. Lowerre) writes:
> >>In case you haven't seen it, there was an article in the October
> >>28 issue of Time about the latest computer chess machine, Hitech.
> >>
> >>The machine is currently rated at about 2250 which is master level
> >>but Hans feels its actual rating is about 2500. The machine will
> >>be entered in more turnaments to determine its actual rating and
> >>to find the level of player that can consistently beat it. In
> >>the mean time, its weaknesses are being patched.
> >>
> >
> >I find the 2500 claim a little hard to believe. As the ratings get higher
> >the more chess knowlege is required to be embedded in the program. (Just
> >examine how large the opening libraries have grown from year to year in the
> >best programs.) And, after leaving opening book the more chess knowlege
> >embedded in the evaluation algorithms the slower which means fewer moves
> >examined which leads to weak tactical play blundering.
> >
> >One obvious method of attack is to so specialize the program that it has
> >a well defined goal decided at the time of exit from the opening book.
> >But this would take a substantial effort and the results would still be
> >inflexible. Anyone know any details of Hans system?
> >
> >Skeptically - Dave Trissel {ihnp4,seismo}!ut-sally!im4u!oakhill!davet
The evaluation of positions after each move could be expensive if one
were to include a large amount of chess knowledge in the evaluation.
However, Hitech, like its predecessor Tech, uses a very simple evaluation
metric, material gain or loss. However, with this type of evaluation, the
program would be willing to play P-KR4 just as much as P-K4 for the opening
move. Thus, the "chess knowledge" is put in to sort, or prioritise, the
moves at the top of the search tree and the search is used to evaluate the
tactical feasibility of the ordered set of moves. The kind of "chess
knowledge" used depends on the position, i.e., opening book, middle game,
king safety, end game, etc.
>
>
> On the other hand, who would know better than a rated GM... Think
> Hitech beats Berliner at games?
I asked Hans how he plays against Hitech. Since he knows how the machine
plays, he has an advantage. However, he says he played one game with it
and drew.
Thread Navigation
This is a paginated view of messages in the thread with full content displayed inline.
Messages are displayed in chronological order, with the original post highlighted in green.
Use pagination controls to navigate through all messages in large threads.
Back to All Threads