25,161
edits
Changes
Created page with "'''Home * Conferences * Advances in Computer Chess 4''' '''< Prev Next >''' FILE:Brunel..."
'''[[Main Page|Home]] * [[Conferences]] * Advances in Computer Chess 4'''
'''[[Advances in Computer Chess 3|< Prev]] [[Advances in Computer Chess 5|Next >]]'''
[[FILE:Brunel Statue on Brunel University grounds.jpg|border|right|thumb|Statue of [https://en.wikipedia.org/wiki/Isambard_Kingdom_Brunel Isambard Kingdom Brunel] <ref>[https://en.wikipedia.org/wiki/Brunel_University Brunel University]</ref> ]]
The '''Advances in Computer Chess 4''' conference was held at [https://en.wikipedia.org/wiki/Brunel_University Brunel University], [https://en.wikipedia.org/wiki/Uxbridge Uxbridge], [https://en.wikipedia.org/wiki/West_London West London], [https://en.wikipedia.org/wiki/United_Kingdom UK], on April 17-18, [[Timeline#1984|1984]]. Chairman of the conference as well as editor of the conference proceedings was [[Don Beal]].
=Proceedings=
* Advances in Computer Chess 4
: [[Don Beal]]. Editor, (March 1986)
: Cadogan Chess Books
: [https://en.wikipedia.org/wiki/Elsevier Elsevier] Science Publishing Company
: ISBN-13: 978-0080297637
=Lectures=
# [[Donald Michie]] ('''1986'''). ''Towards a Knowledge Accelerator''.
# [[Hans Berliner]] ('''1986'''). ''Computer Chess at Carnegie Mellon University''. » [[Carnegie Mellon University]]
# [[Robert Hyatt]], [[Albert Gower]], [[Harry Nelson]] ('''1986'''). ''Cray Blitz''. » [[Cray Blitz]]
# [[Alen Shapiro]], [[Donald Michie]] ('''1986'''). ''A Self-commenting Facility for Inductively Synthesised Endgame Expertise''.
# [[Ivan Bratko]], [[Peter Tancig]], [[Simona Tancig]] ('''1986'''). ''Detection of Positional Patterns in Chess''. » [[Simona Tancig#ChessExperiment|Simona Tancig - Chess Experiment]]
# [[Bernd Owsnicki-Klewe|Bernd Owsnicki]], [[Kai von Luck]] ('''1986'''). ''N.N: A Case Study in Chess Knowledge Representation.'' » [[N.N.]]
# [[Reiner Seidel]] ('''1986'''). ''Deriving Correct Pattern Descriptions and Rules for the KRK Endgame by Deductive Methods''.
# [[Danny Kopec]], [[Monroe Newborn]], [[Winston Yu]] ('''1986'''). ''Experiments in Chess Cognition''. [http://www.sci.brooklyn.cuny.edu/%7Ekopec/Publications/Publications/O_32_C.pdf pdf]
# [https://en.wikipedia.org/wiki/William_Hartston William Hartston] ('''1986'''). ''Artificial Stupidity''.
# [[Günther Schrüfer]] ('''1986'''). ''Presence and Absence of Pathology on Game Trees''.
# [[László Lindner]] ('''1986'''). ''Problem Solving: The Present and Possibilities for Development''.
# [[Tony Marsland]], [[Marius Olafsson]], [[Jonathan Schaeffer]] ('''1986'''). ''Multiprocessor Tree-Search Experiments''.
# [[David Levy]] ('''1986'''). ''Chess master versus computer''.
=Photos=
all Photos by [[László Lindner]] <ref>[[László Lindner]], A SZÁMÍTÓGÉPES SAKK KÉPEKBEN című melléklete - The pictures of the Beginning of Chess Computers</ref>
{|
|-
| [[FILE:Berliner1984.JPG|none|border|text-bottom|315px]]
| [[FILE:Marsland1984.JPG|none|border|text-bottom|330px]]
|-
| [[Hans Berliner]]
| [[Tony Marsland]]
|}
<span id="LevyCrayBlitz"></span>
=Challenge Match=
A four game [[Edward Fredkin#Prize|Fredkin]] challenge match between [[Cray Blitz]], the current [[WCCC 1983|World Champion]], and [[David Levy]] took place alongside the conference, won 4-0 by Levy <ref>[[David Levy]] ('''1984'''). ''Chess Master versus Computer''. [[ICGA Journal#7_2|ICCA Journal, Vol. 7, No. 2]]</ref> <ref>[http://findarticles.com/p/articles/mi_m1200/is_v127/ai_3645282 How to beat a chess champion - David Levy vs. computer program CRAY BLITZ] Science News, Feb 16, 1985</ref> <ref>[[Danny Kopec]] ('''1990'''). ''Advances in Man-Machine Play.'' [[Computers, Chess, and Cognition]], pp. 9-32, [http://www.sci.brooklyn.cuny.edu/%7Ekopec/Publications/Publications/O_21_C.pdf pdf]</ref> . Cray Blitz was quite handicapped, since all three team members were involved in a combined terminal (between [[Albert Gower]] at the board and [[Robert Hyatt]] in an separate operator's room) and telephone voice based (between Hyatt in London and [[Harry Nelson]] operating the program) move transfer chain from London to the Cray X-MP located in [https://en.wikipedia.org/wiki/Mendota_Heights,_Minnesota Mendota Heights, Minnesota] and vice versa, which costs approx. 1 minute per move plus some communication errors and take backs. Additionally, Cray Blitz lost round two and three from hardware failures. [[Robert Hyatt|Bob Hyatt]] "I don't think we could have won the match, even without the technical problems we had" <ref>[[Robert Hyatt]] ('''1984'''). ''Cray Blitz versus David Levy''. [[ICGA Journal#7_2|ICCA Journal, Vol. 7, No. 2]]</ref> <ref>[https://www.stmintz.com/ccc/index.php?id=95280 Re: Need 4 games Cray Blitz-Levy 1984] by Mike S., [[CCC]], February 06, 2000</ref>.
[[FILE:LevyHyatt-London1984.JPG|none|border|text-bottom|660px]]
[[David Levy]] and [[Robert Hyatt]], London 1984
=See also=
* [[Levy versus Chess 1978]]
* [[Levy versus Deep Thought 1989]]
=Reports=
* [[Jaap van Oosterwijk Bruyn]] ('''1984'''). ''The Fourth Conference on Advances in Computer Chess''. [[ICGA Journal#7_2|ICCA Journal, Vol. 7, No. 2]]
* [[David Levy]] ('''1984'''). ''Chess Master versus Computer''. [[ICGA Journal#7_2|ICCA Journal, Vol. 7, No. 2]]
* [[Robert Hyatt]] ('''1984'''). ''Cray Blitz versus David Levy''. [[ICGA Journal#7_2|ICCA Journal, Vol. 7, No. 2]]
=Reviews=
* [[Dap Hartmann]] ('''1987'''). ''Book review: Advances in Computer Chess 4''. ACM SIGART Bulletin <ref>[[Dap Hartmann]] ('''1987'''). [http://portal.acm.org/citation.cfm?id=1057627 Book review: Advances in Computer Chess 4] from [http://portal.acm.org/portal.cfm ACM Portal]</ref>
Abstract:
This book contains the papers that were presented on the fourth conference on Advances in Computer Chess, held at Brunel University, London in April 1984. Together with the main tournaments, this tri-annual conference is the main event in the computer chess world. The 13 contributions cover a broad spectrum of topics in computer chess, and some are apprehendable with only elementary chess knowledge. Among these is an article by [[Danny Kopec|Kopec]], [[Monroe Newborn|Newborn]] and [[Winston Yu|Yu]], on the comparison of cognition of selected chess positions between humans and computers. More extreme positions, in which it is argued that real understanding (Intelligence) is needed instead of calculating deep variations, are given in 'Artificial Stupidity' by [http://www.journalisted.com/william-hartson Hartson].
The art of problem solving (including phenomena such as self-mates and help-mates) with results of the best programs in this discipline can be found in the article by [[László Lindner|Lindner]]. Chess Master [[David Levy]] reports his success in defeating the computer world champion [[Cray Blitz]] in a 4 game match which was held during the conference. Most interesting in this respect is his description of the special preparation he put to use. In general, his strategy is probably the best method to exploit a thusfar very basic weakness of computer programs.
[[Robert Hyatt|Hyatt]] et al. present some stunning results of their program, Cray Blitz, which runs on the fastest available computer. They discuss the use of hash tables, and the way in which multi-processing has been taken advantage of. Description and implementation, together with results of multi processing-techniques in two chess programs are described by [[Tony Marsland|Marsland]] et al. [[Hans Berliner|Berliner]], author of [[HiTech|Hitech]], describes in his paper the application of special hardware (VLSI) in the design of an ultra-fast move generator that produces all pseudo-legal moves for a given position in one clock cycle (250 nanoseconds). He furthermore shows results of the [[B*|B* tree-search algorithm]], and describes another one of his programs: [[Patsoc]]. A new trend in computer chess cognition seems to be the notion of '[[Chunking|chunks]]': Groups of pieces that can be identified as one entity. Berliner describes this for [[Pawn|pawns]] in the [[Endgame|endgame]], and [[Ivan Bratko|Brakto]] et al. devote their entire paper to this subject. Chunking is thought to be important, because humans identify them as such which enables strong players to correctly reproduce a given position after only a short moment of examination. A strongly represented subject is the generation and induction of patterns and plans. [[Donald Michie|Michie]] presents his 'Michie Road' in which rules are to be generated from examples provided by an expert. In some cases (special endgames) this expert can be a computer. [[Reiner Seidel|Seidel's]] contribution describes the deduction of patterns in the King+Rook versus King endgame. [[Bernd Owsnicki-Klewe|Owsnicki]] and [[Kai von Luck|von Luck]], both with a thesis on computer chess, discuss a method of plan construction with results from its application in a program called N.N. They illustrate three catagories of possible errors, each with its own cause and each with a different level of solvability. [[Alen Shapiro|Shapiro]] and Michie describe a self-commenting facility whereby expert supplied text fragments attached to individual attributes are recognised to form run-time explanations of decisions made by rules previously induced. A theoretical paper is given by [[Günther Schrüfer|Schruefer]]. He analyses the apparent paradox that experience shows that a deeper tree-search yields better play, whereas mathematical investigation of the problem predicts less reliable results for deeper searches.
=Forum Posts=
* [https://www.stmintz.com/ccc/index.php?id=95273 Need 4 games Cray Blitz-Levy 1984] by Pierre Bourget, [[CCC]], February 06, 2000
=References=
<references />
'''[[Conferences|Up one Level]]'''
'''[[Advances in Computer Chess 3|< Prev]] [[Advances in Computer Chess 5|Next >]]'''
[[FILE:Brunel Statue on Brunel University grounds.jpg|border|right|thumb|Statue of [https://en.wikipedia.org/wiki/Isambard_Kingdom_Brunel Isambard Kingdom Brunel] <ref>[https://en.wikipedia.org/wiki/Brunel_University Brunel University]</ref> ]]
The '''Advances in Computer Chess 4''' conference was held at [https://en.wikipedia.org/wiki/Brunel_University Brunel University], [https://en.wikipedia.org/wiki/Uxbridge Uxbridge], [https://en.wikipedia.org/wiki/West_London West London], [https://en.wikipedia.org/wiki/United_Kingdom UK], on April 17-18, [[Timeline#1984|1984]]. Chairman of the conference as well as editor of the conference proceedings was [[Don Beal]].
=Proceedings=
* Advances in Computer Chess 4
: [[Don Beal]]. Editor, (March 1986)
: Cadogan Chess Books
: [https://en.wikipedia.org/wiki/Elsevier Elsevier] Science Publishing Company
: ISBN-13: 978-0080297637
=Lectures=
# [[Donald Michie]] ('''1986'''). ''Towards a Knowledge Accelerator''.
# [[Hans Berliner]] ('''1986'''). ''Computer Chess at Carnegie Mellon University''. » [[Carnegie Mellon University]]
# [[Robert Hyatt]], [[Albert Gower]], [[Harry Nelson]] ('''1986'''). ''Cray Blitz''. » [[Cray Blitz]]
# [[Alen Shapiro]], [[Donald Michie]] ('''1986'''). ''A Self-commenting Facility for Inductively Synthesised Endgame Expertise''.
# [[Ivan Bratko]], [[Peter Tancig]], [[Simona Tancig]] ('''1986'''). ''Detection of Positional Patterns in Chess''. » [[Simona Tancig#ChessExperiment|Simona Tancig - Chess Experiment]]
# [[Bernd Owsnicki-Klewe|Bernd Owsnicki]], [[Kai von Luck]] ('''1986'''). ''N.N: A Case Study in Chess Knowledge Representation.'' » [[N.N.]]
# [[Reiner Seidel]] ('''1986'''). ''Deriving Correct Pattern Descriptions and Rules for the KRK Endgame by Deductive Methods''.
# [[Danny Kopec]], [[Monroe Newborn]], [[Winston Yu]] ('''1986'''). ''Experiments in Chess Cognition''. [http://www.sci.brooklyn.cuny.edu/%7Ekopec/Publications/Publications/O_32_C.pdf pdf]
# [https://en.wikipedia.org/wiki/William_Hartston William Hartston] ('''1986'''). ''Artificial Stupidity''.
# [[Günther Schrüfer]] ('''1986'''). ''Presence and Absence of Pathology on Game Trees''.
# [[László Lindner]] ('''1986'''). ''Problem Solving: The Present and Possibilities for Development''.
# [[Tony Marsland]], [[Marius Olafsson]], [[Jonathan Schaeffer]] ('''1986'''). ''Multiprocessor Tree-Search Experiments''.
# [[David Levy]] ('''1986'''). ''Chess master versus computer''.
=Photos=
all Photos by [[László Lindner]] <ref>[[László Lindner]], A SZÁMÍTÓGÉPES SAKK KÉPEKBEN című melléklete - The pictures of the Beginning of Chess Computers</ref>
{|
|-
| [[FILE:Berliner1984.JPG|none|border|text-bottom|315px]]
| [[FILE:Marsland1984.JPG|none|border|text-bottom|330px]]
|-
| [[Hans Berliner]]
| [[Tony Marsland]]
|}
<span id="LevyCrayBlitz"></span>
=Challenge Match=
A four game [[Edward Fredkin#Prize|Fredkin]] challenge match between [[Cray Blitz]], the current [[WCCC 1983|World Champion]], and [[David Levy]] took place alongside the conference, won 4-0 by Levy <ref>[[David Levy]] ('''1984'''). ''Chess Master versus Computer''. [[ICGA Journal#7_2|ICCA Journal, Vol. 7, No. 2]]</ref> <ref>[http://findarticles.com/p/articles/mi_m1200/is_v127/ai_3645282 How to beat a chess champion - David Levy vs. computer program CRAY BLITZ] Science News, Feb 16, 1985</ref> <ref>[[Danny Kopec]] ('''1990'''). ''Advances in Man-Machine Play.'' [[Computers, Chess, and Cognition]], pp. 9-32, [http://www.sci.brooklyn.cuny.edu/%7Ekopec/Publications/Publications/O_21_C.pdf pdf]</ref> . Cray Blitz was quite handicapped, since all three team members were involved in a combined terminal (between [[Albert Gower]] at the board and [[Robert Hyatt]] in an separate operator's room) and telephone voice based (between Hyatt in London and [[Harry Nelson]] operating the program) move transfer chain from London to the Cray X-MP located in [https://en.wikipedia.org/wiki/Mendota_Heights,_Minnesota Mendota Heights, Minnesota] and vice versa, which costs approx. 1 minute per move plus some communication errors and take backs. Additionally, Cray Blitz lost round two and three from hardware failures. [[Robert Hyatt|Bob Hyatt]] "I don't think we could have won the match, even without the technical problems we had" <ref>[[Robert Hyatt]] ('''1984'''). ''Cray Blitz versus David Levy''. [[ICGA Journal#7_2|ICCA Journal, Vol. 7, No. 2]]</ref> <ref>[https://www.stmintz.com/ccc/index.php?id=95280 Re: Need 4 games Cray Blitz-Levy 1984] by Mike S., [[CCC]], February 06, 2000</ref>.
[[FILE:LevyHyatt-London1984.JPG|none|border|text-bottom|660px]]
[[David Levy]] and [[Robert Hyatt]], London 1984
=See also=
* [[Levy versus Chess 1978]]
* [[Levy versus Deep Thought 1989]]
=Reports=
* [[Jaap van Oosterwijk Bruyn]] ('''1984'''). ''The Fourth Conference on Advances in Computer Chess''. [[ICGA Journal#7_2|ICCA Journal, Vol. 7, No. 2]]
* [[David Levy]] ('''1984'''). ''Chess Master versus Computer''. [[ICGA Journal#7_2|ICCA Journal, Vol. 7, No. 2]]
* [[Robert Hyatt]] ('''1984'''). ''Cray Blitz versus David Levy''. [[ICGA Journal#7_2|ICCA Journal, Vol. 7, No. 2]]
=Reviews=
* [[Dap Hartmann]] ('''1987'''). ''Book review: Advances in Computer Chess 4''. ACM SIGART Bulletin <ref>[[Dap Hartmann]] ('''1987'''). [http://portal.acm.org/citation.cfm?id=1057627 Book review: Advances in Computer Chess 4] from [http://portal.acm.org/portal.cfm ACM Portal]</ref>
Abstract:
This book contains the papers that were presented on the fourth conference on Advances in Computer Chess, held at Brunel University, London in April 1984. Together with the main tournaments, this tri-annual conference is the main event in the computer chess world. The 13 contributions cover a broad spectrum of topics in computer chess, and some are apprehendable with only elementary chess knowledge. Among these is an article by [[Danny Kopec|Kopec]], [[Monroe Newborn|Newborn]] and [[Winston Yu|Yu]], on the comparison of cognition of selected chess positions between humans and computers. More extreme positions, in which it is argued that real understanding (Intelligence) is needed instead of calculating deep variations, are given in 'Artificial Stupidity' by [http://www.journalisted.com/william-hartson Hartson].
The art of problem solving (including phenomena such as self-mates and help-mates) with results of the best programs in this discipline can be found in the article by [[László Lindner|Lindner]]. Chess Master [[David Levy]] reports his success in defeating the computer world champion [[Cray Blitz]] in a 4 game match which was held during the conference. Most interesting in this respect is his description of the special preparation he put to use. In general, his strategy is probably the best method to exploit a thusfar very basic weakness of computer programs.
[[Robert Hyatt|Hyatt]] et al. present some stunning results of their program, Cray Blitz, which runs on the fastest available computer. They discuss the use of hash tables, and the way in which multi-processing has been taken advantage of. Description and implementation, together with results of multi processing-techniques in two chess programs are described by [[Tony Marsland|Marsland]] et al. [[Hans Berliner|Berliner]], author of [[HiTech|Hitech]], describes in his paper the application of special hardware (VLSI) in the design of an ultra-fast move generator that produces all pseudo-legal moves for a given position in one clock cycle (250 nanoseconds). He furthermore shows results of the [[B*|B* tree-search algorithm]], and describes another one of his programs: [[Patsoc]]. A new trend in computer chess cognition seems to be the notion of '[[Chunking|chunks]]': Groups of pieces that can be identified as one entity. Berliner describes this for [[Pawn|pawns]] in the [[Endgame|endgame]], and [[Ivan Bratko|Brakto]] et al. devote their entire paper to this subject. Chunking is thought to be important, because humans identify them as such which enables strong players to correctly reproduce a given position after only a short moment of examination. A strongly represented subject is the generation and induction of patterns and plans. [[Donald Michie|Michie]] presents his 'Michie Road' in which rules are to be generated from examples provided by an expert. In some cases (special endgames) this expert can be a computer. [[Reiner Seidel|Seidel's]] contribution describes the deduction of patterns in the King+Rook versus King endgame. [[Bernd Owsnicki-Klewe|Owsnicki]] and [[Kai von Luck|von Luck]], both with a thesis on computer chess, discuss a method of plan construction with results from its application in a program called N.N. They illustrate three catagories of possible errors, each with its own cause and each with a different level of solvability. [[Alen Shapiro|Shapiro]] and Michie describe a self-commenting facility whereby expert supplied text fragments attached to individual attributes are recognised to form run-time explanations of decisions made by rules previously induced. A theoretical paper is given by [[Günther Schrüfer|Schruefer]]. He analyses the apparent paradox that experience shows that a deeper tree-search yields better play, whereas mathematical investigation of the problem predicts less reliable results for deeper searches.
=Forum Posts=
* [https://www.stmintz.com/ccc/index.php?id=95273 Need 4 games Cray Blitz-Levy 1984] by Pierre Bourget, [[CCC]], February 06, 2000
=References=
<references />
'''[[Conferences|Up one Level]]'''
