Wikispaces : chessprogramming - items matching description

Advances in Computer Chess 1

GerdIsenberg — Thu, 22 Oct 2015 10:13:58 GMT

Home * Conferences * Advances in Computer Chess 1
Next >

		The Advances in Computer Chess 1 conference was held in March 1975 at Balliol College, Oxford, England, and was organized by the Atlas Computer Laboratory and the Society for the Study of Artificial Intelligence and Simulation of Behaviour (SSAISB). Proceedings were published in 1977, edited by Mike Clarke. It was already the second conference on computer chess, after a conference meeting on chess playing by computer in May 1973 at Atlas Computer Laboratory ^[1].
Balliol College, Oxford ^[2]

Proceedings

Advances in Computer Chess 1
M.R.B. Clarke, Editor, 1977
Edinburgh University Press, Edinburgh.
ISBN 0-852-24292-1, amazom

Lectures

Hans Berliner (1977). A Representation and Some Mechanisms for a Problem-Solving Chess Program. pdf
Ron Atkin (1977). Positional Play in Chess by Computer. ^[3]
Donald Michie (1977). King and Rook Against King: Historical Background and a Problem on the Infinite Board.
Soei T. Tan (1977). Describing Pawn Structures.
John Birmingham, Peter Kent (1977). Tree-searching and tree-pruning techniques.
Mike Clarke (1977). A quantitative study of KPK.

Reviews

Alex Bell (1975).Techniques for playing the end game. Atlas Computer Laboratory, hosted by Rutherford Appleton Laboratory (RAL)
Jack Good (1978). Review of "Advances in Computer Chess, Volume 1. by M.R.B. Clarke"; University Press, 1977. ACM SIGART Bulletin, Issue 66

The Forerunner

The first conference meeting on computer chess took place at the Atlas Computer Laboratory May 1973. It was the forerunner of the later Advances in Computer Chess conferences. Alex Bell about the arisen of the conference ^[4] :

In 1972 I was back in England again and met John Scott, who was doing a PhD, and his tutor Dr. Alan Bond. Naturally we talked about chess programs and the recent happenings in the American ACM tournaments. As we talked it became fairly obvious that in the intervening 4 years a number of new ideas had appeared on the scene. One idea was called refutation, a technique which (like alpha-beta) could vastly speed up the tree searching without any loss of information (see Chapter 9 - Machine Technique).

Even more mysterious was a paper Multi Dimensional Structure in the Game of Chess by Ron Atkin ^[5] , a maths lecturer at Essex University. Up to this point all chess programs had evaluation functions which were decidedly ad hoc, the programmers had a feeling in their water that certain features, material, mobility, control of the centre, king safety, pawn structure, etc., were the most important and accordingly stuck them in the program with very little idea of their precise effect. Now here was a mathematician who, with lots of squiggly things, appeared to have a precise mathematical evaluation function. Unfortunately neither John nor I could understand the paper - so why not get Atkin to talk about it. There were a few other new ideas I did not understand - a new, knowledge approach to solving end games and some psychological theories about how chess players think - so why not have a conference? If nothing else I might get some idea of what was going on.

The first Computer Chess Conference took place at the Atlas Computer Laboratory in May 1973. Apart from inviting the speakers it was also obvious that the conference would have to demonstrate a chess program in some form and it is at this point in time that MASTER really got started.
--
From then on the operators played more carefully and revealed that the program, because it still only had a shallow search, still suffered badly from horizon effect. Nevertheless it did win a few more games and it was decided to use it as the demonstration program at the conference.

Well it didn't win a game, hardly surprising since it was up against much stronger players. Nevertheless several people noticed that the program was usually achieving its main aim of controlling the centre squares; in other words, it was quite successful in doing what little it had been told to do but, from then on, it had no further direction other than a vague idea of advancing its own pawns and blocking its opponent's. Peter improved its sense of purpose by making the program, as the game progressed, put less emphasis on controlling the fixed centre squares and more and more emphasis on controlling the squares around the enemy king, wherever he may be. Because of mini-max this also caused the program to protect the squares around its own king far more effectively.

ACC1

The conference on computer chess took place at Balliol College, Oxford in March 1975. It was organized by Atlas Computer Laboratory and the Society for the Study of Artificial Intelligence and Simulation of Behaviour (SSAISB), and was later declared as Advances in Computer Chess 1 conference. Proceedings were published by Mike Clarke from Queen Mary College. Some excerpt from co-organizer, Alex Bell's report in Computer Weekly, April 10, 1975, Techniques for playing the end game ^[6] :

AFICIONADOS of the arts of chess and computing gathered at Balliol College, Oxford, last month for the second conference on computer chess organised by the Atlas Computer Laboratory and the Artificial Intelligence and Simulation of Behaviour study group.

A number of experts were invited to give papers. on their work, including Dr Mikhail Donskoy of the USSR, one of the authors of the world champion program, KAISSA. Unfortunately Donskoy was unable to attend, a disappointment only mitigated by the presence from the US of Dr Hans Berliner, of Carnegie-Mellon. Berliner is the world correspondence chess champion and has also spent the last eight or nine years programming computers to play the game. To most people in the practical, model building side of the subject, ie making a program play the computer game, Berliner is THE expert. Although full of good, implementable ideas he has no illusions as to the limitations of such chess programs.
--
The conference itself lasted one and a half days and the papers (depending on the listener) ranged from the profound to the puerile. I have no desire to repeat my own personal views, indeed as one of the organisers I helped to provide a platform for speakers whose views I found astonishing. What did seem evident to me was that the majority of the audience fell into one of three categories. One group is the artificial intelligentsia. They fully understand the difficulties of the problem and are still thinking about how to solve it. The second group are the let's get on and program something crunchers, the model makers, the people who can make big computers float round the room whistling God save the Queen. These people absolutely refuse to put anything remotely resembling knowledge, chess or otherwise, into their programs if they can avoid it, believing that if the result plays good chess then it can be more easily adapted to attempt other, more useful, decision making problems. The third group is the most important, these are the people who are new to the subject, the people who say, It sounds like a fascinating problem and I'd like to know what's going on.

Hans Berliner fits into two of these categories, his talk covered the AI approach and the crunchers, but he is hardly a newcomer. He was the first speaker and the domain of his talk was chess tactics with emphasis on recognising situations and dealing with them explicitly. He is full of good ideas and techniques which are relevant to the problem of selecting the right move in a game of chess and, more important, showed clearly how each idea and technique could be implemented in a computer.

The next paper by Ron Atkin, of Essex University, was more profound. Atkin has developed a mathematically valid approach to positional play in chess and also described a method of simulating the hierarchical method used by the chess master. His ideas have an intuitive appeal; one feels he must be right but the problem of implementing the ideas in a computer, are enormous and, as yet, unsolved. Another problem was that not a single person in the audience was sufficiently competent to stand up and say, "This is all very well but your approach will not handle this situation in a chess game, a tactic which often shoots down the simple minded crunch programs".

The final talk on the first day was given by Professor Donald Michie of the Machine Intelligence Research Unit, Edinburgh, who dealt with mechanisation of the King, Rook versus King end game. The first machine to play this end game was built by Torres y Quevado c. 1900. Hardly anything was published about it and Michie made an interesting reconstruction of the machine, and I have to admit that Michie had got most of it right.

The next day the speakers included Dr Soei Tan, also of Edinburgh, who dealt with pawn structures; John Birmingham and Peter Kent partially described how MASTER operates; and Mike Clarke, of Queen Mary College, talked about the King, Pawn versus King ending. Clarke's approach is much more scientific than the crunch programs; he has enumerated all possible positions of the K, P v K end game (there are 906,545,760 of them) and discovered which are wins and which are draws. He has done a similar enumeration for the King, Rook v King ending and should, with a little more effort. be able to scientifically work backwards to the 16 pawns, 16 pieces end game.

As can be seen a great deal of time was spent on this King, Rook v King ending. This is interesting because if this ending can cause such difficulty then it is intuitively obvious that the full game must be at least an order of magnitude more difficult. This is intuitively obvious but difficult to prove, nevertheless it appears to be true in the real world. I certainly have great difficulty obtaining a draw with the lone King. Finally, Max Bramer has offered to demonstrate his K,R v K and K,P v K programs to anyone who is interested. He can be contacted at the Open University.

Forum Posts

Re: Whatever happened to Neural Network Chess programs? by Andy Walker, rgcc, March 28, 2000 » Ron Atkin

External Links

Small Faces - Itchycoo Park, Beat-Club, September 23, 1967, YouTube Video

References

^ Alex Bell (ed.) (1973). Computer Chess. Proceedings May 1973 Meeting on chess playing by computer. Science Research Council, Atlas Computer Laboratory
^ Oxford - Balliol College, One of my favourite views, across the appropriately-named Broad Street, May 30 2009, Photographer Peter Trimming, source geograph.org.uk
^ Re: Whatever happened to Neural Network Chess programs? by Andy Walker, rgcc, March 28, 2000
^ Alex Bell (1978). MASTER at IFIPS. Excerpt from: The Machine Plays Chess? Atlas Computer Laboratory, hosted by Rutherford Appleton Laboratory (RAL)
^ Ron Atkin (1972). Multi-Dimensional Structure in the Game of Chess. In International Journal of Man-Machine Studies, 4 pp. 341-362
^ Alex Bell (1975).Techniques for playing the end game. Atlas Computer Laboratory, hosted by Rutherford Appleton Laboratory (RAL)

What links here?

Page	Date Edited
Advances in Computer Chess 1	Oct 22, 2015
Advances in Computer Chess 2	Dec 25, 2017
Alan H. Bond	Oct 7, 2014
Alex Bell	Mar 1, 2017
Andy Walker	Dec 9, 2016
Atlas Computer Laboratory	Feb 10, 2015
CAPS	Dec 23, 2017
Conferences	Dec 18, 2017
Connectivity	Mar 6, 2016
Donald Michie	Dec 23, 2017
El Ajedrecista	Feb 25, 2015
Evaluation	Feb 1, 2018
Georgy Adelson-Velsky	Apr 9, 2018
Hans Berliner	Jun 10, 2017
Jack Good	Dec 22, 2017
John Birmingham	Jan 7, 2016
Kaissa	Apr 9, 2018
KPK	May 12, 2016
KRK	Nov 26, 2016
Master	Dec 28, 2017
Mike Clarke	May 23, 2016
Mikhail Donskoy	Dec 23, 2017
Neural Networks	Mar 12, 2018
Pawn Structure	Oct 2, 2017
Peter Kent	Jan 7, 2016
Pruning	Jan 1, 2018
Razoring	Oct 5, 2015
Ron Atkin	Oct 26, 2016
Soei Tan	Oct 27, 2012
Tactics	Jan 12, 2018
Vladimir Arlazarov	May 20, 2016

Up one Level

Advances in Computer Chess 2

GerdIsenberg — Mon, 25 Dec 2017 09:47:05 GMT

Home * Conferences * Advances in Computer Chess 2
< Prev Next >

		The Advances in Computer Chess 2 conference was hosted by the University of Edinburgh and held at King's Buildings ^[1], Edinburgh, Scotland, on April 10-11, 1978. Proceedings were published in 1980, edited by Mike Clarke.
King's Buildings seen from the Braid Hills ^[2]

Proceedings

Advances in Computer Chess 2
M.R.B. Clarke, Editor, February 1980
Edinburgh University Press, Edinburgh
ISBN-10: 0-852-24377-4
ISBN-13: 978-0852243770, amazom

Lectures

Don Beal, Mike Clarke (1980). The Construction of Economical and Correct Algorithms for King and Pawn against King.
Jacques Pitrat (1980). The Behaviour of a Chess Combination Program using Plans.
Ivan Bratko, Donald Michie (1980). A Representation of Pattern-Knowledge in Chess Endgames.
Max Bramer (1980). An Optimal Algorithm for KPK using Pattern Knowledge.
Don Beal (1980). An analysis of Minimax.
Mike Clarke (1980). The Theory of Coordinate Squares.
Danny Kopec, Tim Niblett (1980). How Hard is the Play of the King-Rook-King-Knight Ending?
John Birmingham, Peter Kent (1980). Mate at a Glance.
Peter Kent (1980). The MASTER Chess Program.

Announcement

Advances in Computer Chess 2, announcement in The Computer Journal 1978 21(1) 94 ^[3]

Reviews

Harry Shershow (1980). On The Science of Chess-Thinking. Personal Computing, Vol. 4, No. 9, pp. 80

External Links

References

^ Introduction | King's Buildings
^ View of King's Buildings from the Braid Hills, Photo by Kim Traynor, August 26, 2011, Wikimedia Commons, King's Buildings from Wikipedia
^ The Computer Journal 1978 21(1):94 © 1978 by British Computer Society

What links here?

Page	Date Edited
Advances in Computer Chess 1	Oct 22, 2015
Advances in Computer Chess 2	Dec 25, 2017
Advances in Computer Chess 3	Jul 23, 2015
Checkmate	Apr 13, 2018
Chunking	Jun 12, 2017
Combination	Oct 25, 2016
Conferences	Dec 18, 2017
Corresponding Squares	Oct 9, 2017
Danny Kopec	Oct 1, 2016
Don Beal	Jul 27, 2017
Donald Michie	Dec 23, 2017
Endgame	Sep 18, 2017
Harry Shershow	Dec 27, 2017
Ivan Bratko	Aug 16, 2017
Jacques Pitrat	Aug 7, 2015
John Birmingham	Jan 7, 2016
Knowledge	Jul 22, 2017
KPK	May 12, 2016
Master	Dec 28, 2017
Mate at a Glance	Sep 24, 2014
Max Bramer	May 20, 2014
Mike Clarke	May 23, 2016
Pattern Recognition	Sep 8, 2017
Personal Computing	Dec 27, 2017
Peter Kent	Jan 7, 2016
Planning	Feb 12, 2018
Search Pathology	Nov 26, 2017
Strategy	Jan 18, 2018
Tim Niblett	May 22, 2014

Up one Level

Advances in Computer Chess 3

GerdIsenberg — Thu, 23 Jul 2015 21:30:50 GMT

Home * Conferences * Advances in Computer Chess 3
< Prev Next >

		The Advances in Computer Chess 3 conference was held at Imperial College, London, UK, on April 9-10, 1981. The conference was planned and organized by Mike Clarke, who especially welcomed Mikhail Botvinnik at the opening ceremony ^[1].
Imperial College ^[2]

Proceedings

Advances in Computer Chess 3
M.R.B. Clarke, Editor, (October 1982)
Elsevier Science Publishing Company
ISBN-10: 0080268986
ISBN-13: 978-0080268989, amazom

Lectures

Ivan Bratko, Matjaž Gams (1982). Error Analysis of the Minimax Principle.
Don Beal (1982). Benefits of minimax search.
Kevin Coplan (1982). A Special-Purpose Machine for an Improved Search Algorithm for Deep Chess Combinations.
Joe Condon, Ken Thompson (1982). Belle Chess Hardware.
Ken Thompson (1982). Computer Chess Strength.
Ivan Bratko, Danny Kopec (1982). A Test for Comparison of Human and Computer Performance in Chess. pdf
Max Bramer (1982). Machine-Aided Refinement of Correct Strategies for the Endgame in Chess.
Alen Shapiro, Tim Niblett (1982). Automatic Induction of Classification Rules for Chess End game.
Thomas Nitsche (1982). A Learning Chess Program.
Max Bramer, B. E. P. Alden (1982). A Program for Solving Retrograde Analysis Chess Problems.
Donald Michie (1982). Information and Complexity in Chess.
Hermann Kaindl (1982). Positional Long-Range Planning in Computer Chess.
Mikhail Botvinnik (1982). Decision Making and Computers.

Reports

Jaap van den Herik (1981). Progress in Computer Chess. AISB Quarterly, reprinted in ICCA Newsletter, Vol. 4. No. 3, pdf
Jaap van den Herik (1981). Computer Chess Today and Tomorrow: An Interview with Donald Michie. Computer Chess Digest Annual 1984

External Links

References

^ Jaap van den Herik (1981). Progress in Computer Chess. AISB Quarterly, reprinted in ICCA Newsletter, Vol. 4. No. 3, pdf
^ Imperial College London crest, Wikimedia Commons, Imperial College London, Wikipedia

What links here?

Page	Date Edited
Advances in Computer Chess 2	Dec 25, 2017
Advances in Computer Chess 3	Jul 23, 2015
Advances in Computer Chess 4	Jan 22, 2018
Alen Shapiro	May 3, 2015
Alvin M. Despain	Feb 17, 2015
Automated Tuning	Feb 27, 2018
Belle	Jan 18, 2018
Berkeley Chess Microprocessor	May 22, 2013
Botvinnik-Markoff Extension	Nov 27, 2015
Bratko-Kopec Test	Jun 1, 2015
CHEOPS	Apr 18, 2015
Combination	Oct 25, 2016
Conferences	Dec 18, 2017
Danny Kopec	Oct 1, 2016
Depth	Feb 25, 2018
Don Beal	Jul 27, 2017
Donald Michie	Dec 23, 2017
Endgame	Sep 18, 2017
Hardware	Jan 20, 2018
Hermann Kaindl	Oct 31, 2016
ICGA Journal	Dec 21, 2017
Ivan Bratko	Aug 16, 2017
Jaap van den Herik	Sep 18, 2017
Joe Condon	Jan 7, 2016
Ken Thompson	Sep 8, 2017
Kevin Coplan	Dec 17, 2016
Knowledge	Jul 22, 2017
Learning	Feb 20, 2018
Match Statistics	Mar 31, 2018
Matjaž Gams	May 23, 2016
Max Bramer	May 20, 2014
Mike Clarke	May 23, 2016
Mikhail Botvinnik	Jul 15, 2017
Minimax	Dec 29, 2017
Move Generation	Jan 29, 2018
NegaC*	Dec 17, 2016
Ozalp Babaoglu	Oct 5, 2013
Pattern Recognition	Sep 8, 2017
Pioneer	Dec 23, 2017
Planning	Feb 12, 2018
Playing Strength	Mar 31, 2018
Retrograde Analysis	Mar 21, 2017
Search Pathology	Nov 26, 2017
Strategy	Jan 18, 2018
Sunfish	Jan 11, 2018
Test-Positions	Feb 25, 2018
Thomas Nitsche	Jan 7, 2016
Tim Niblett	May 22, 2014
Trajectory	Jan 3, 2015
Transposition Table	Apr 19, 2018

Up one Level

Advances in Computer Chess 4

GerdIsenberg — Mon, 22 Jan 2018 13:52:08 GMT

Home * Conferences * Advances in Computer Chess 4
< Prev Next >

		The Advances in Computer Chess 4 conference was held at Brunel University, Uxbridge, West London, UK, on April 17-18, 1984. Chairman of the conference as well as editor of the conference proceedings was Don Beal.
Statue of Isambard Kingdom Brunel ^[1]

Proceedings

Advances in Computer Chess 4
Don Beal. Editor, (March 1986)
Cadogan Chess Books
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 - Chess Experiment
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. pdf
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 ^[2]


Hans Berliner		Tony Marsland

Challenge Match

A four game Fredkin challenge match between Cray Blitz, the current World Champion, and David Levy took place alongside the conference, won 4-0 by Levy ^[3] ^[4] ^[5] . 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 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. Bob Hyatt "I don't think we could have won the match, even without the technical problems we had" ^[6] ^[7].

David Levy and Robert Hyatt, London 1984

Reports

Jaap van Oosterwijk Bruyn (1984). The Fourth Conference on Advances in Computer Chess. ICCA Journal, Vol. 7, No. 2
David Levy (1984). Chess Master versus Computer. ICCA Journal, Vol. 7, No. 2
Robert Hyatt (1984). Cray Blitz versus David Levy. ICCA Journal, Vol. 7, No. 2

Reviews

Dap Hartmann (1987). Book review: Advances in Computer Chess 4. ACM SIGART Bulletin ^[8]

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 Kopec, Newborn and 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 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 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.

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 Marsland et al. Berliner, author of 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* tree-search algorithm, and describes another one of his programs: Patsoc. A new trend in computer chess cognition seems to be the notion of 'chunks': Groups of pieces that can be identified as one entity. Berliner describes this for pawns in the endgame, and 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. 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. Seidel's contribution describes the deduction of patterns in the King+Rook versus King endgame. Owsnicki and 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. 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 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

Need 4 games Cray Blitz-Levy 1984 by Pierre Bourget, CCC, February 06, 2000

References

^ Brunel University
^ László Lindner, A SZÁMÍTÓGÉPES SAKK KÉPEKBEN című melléklete - The pictures of the Beginning of Chess Computers
^ David Levy (1984). Chess Master versus Computer. ICCA Journal, Vol. 7, No. 2
^ How to beat a chess champion - David Levy vs. computer program CRAY BLITZ Science News, Feb 16, 1985
^ Danny Kopec (1990). Advances in Man-Machine Play. Computers, Chess, and Cognition, pp. 9-32, pdf
^ Robert Hyatt (1984). Cray Blitz versus David Levy. ICCA Journal, Vol. 7, No. 2
^ Re: Need 4 games Cray Blitz-Levy 1984 by Mike S., CCC, February 06, 2000
^ Dap Hartmann (1987). Book review: Advances in Computer Chess 4 from ACM Portal

What links here?

Page	Date Edited
Advances in Computer Chess 3	Jul 23, 2015
Advances in Computer Chess 4	Jan 22, 2018
Advances in Computer Chess 5	Dec 2, 2017
Albert Gower	Jan 7, 2016
Alen Shapiro	May 3, 2015
Bernd Owsnicki-Klewe	Jan 20, 2018
Carnegie Mellon University	Feb 12, 2018
Chess Problems, Compositions and Studies	Feb 19, 2018
Chunking	Jun 12, 2017
Cognition	Dec 8, 2017
Conferences	Dec 18, 2017
Cray Blitz	Dec 25, 2017
Danny Kopec	Oct 1, 2016
David Levy	Jan 3, 2017
Don Beal	Jul 27, 2017
Donald Michie	Dec 23, 2017
Doubled Pawn	Mar 27, 2017
Günther Schrüfer	Jan 7, 2016
Hans Berliner	Jun 10, 2017
Harry Nelson	Jul 26, 2017
ICGA Journal	Dec 21, 2017
Ivan Bratko	Aug 16, 2017
Jaap van Oosterwijk Bruyn	May 22, 2016
Jonathan Schaeffer	Jan 29, 2018
Kai von Luck	Jan 20, 2018
Knowledge	Jul 22, 2017
KRK	Nov 26, 2016
László Lindner	Sep 2, 2017
Levy versus Chess 1978	Apr 1, 2017
Levy versus Deep Thought 1989	Jun 2, 2015
Marius Olafsson	Jan 9, 2016
Monroe Newborn	Dec 23, 2017
N.N.	Jan 20, 2018
Parallel Search	Dec 30, 2017
Patsoc	Jan 7, 2016
Pattern Recognition	Sep 8, 2017
Peter Tancig	Nov 7, 2012
Reiner Seidel	May 23, 2016
Rival	Jul 30, 2017
Robert Hyatt	Dec 25, 2017
Search Pathology	Nov 26, 2017
Simona Tancig	Nov 7, 2012
Tony Marsland	Nov 27, 2017
Tournaments	Dec 21, 2017

Up one Level

Advances in Computer Chess 5

GerdIsenberg — Sat, 02 Dec 2017 22:44:38 GMT

Home * Conferences * Advances in Computer Chess 5
< Prev Next >

		The 5th Advances in Computer Chess Conference was held in De Leeuwenhorst, Noordwijkerhout, the Netherlands, on April 27 and 28, 1987. ACC is the conference of the ICCA. Conference chairman was Jaap van Oosterwijk Bruyn, the first chair of the Dutch Computer Chess Federation ^[1] .
Leeuwenhorst ^[2]

Proceedings

Synopsis

Mephisto Best-Publication Award

Proceedings

Advances in Computer Chess 5 ^[3] ^[4]
Don Beal, Editor January 1989
Elsevier Science Publishing Company
ISBN-10: 0-444-87159-4
ISBN-13: 978-0444871596

Synopsis

Thirty years of research has so far failed to produce Computer Chess programs that perform well and behave internally in ways that psychologists recognise as human-like. The task is harder than was realised, but the resulting knowledge gained from trying to solve the problem is all the greater. In this volume, the keynote paper identifies differences between human and computer information processing, and makes the bold prediction that some humans will continue to outperform the world's most powerful computers at chess until at least the year 2000. The other research papers cover a variety of subjects, including mathematical structure, knowledge engineering, search algorithms, psychology, learning, state-of-the-art chess machines, and attempts to bring theoretical clarity to empirical discoveries.

Mephisto Best-Publication Award

The 1988-89 Mephisto Award for the best publication on Computer Chess was awarded to `Advances in Computer Chess 5', edited by Don Beal. The jury consisted of Jaap van den Herik, Monty Newborn, Ken Thompson, Jonathan Schaeffer and Tony Marsland. Don Beal received the latest and most powerful Mephisto Chess Computer in a de luxe wooden board. The ICCA congratulated Don Beal and all the contributors to `this excellent book'.

Photos

During


Don Beal on Null Move ^[5]		Jonathan Schaeffer on Conspiracy Numbers ^[6]

Between

Hans Berliner, Hermann Kaindl, Helmut Horacek, Adriaan de Groot and Reiner Seidel ^[7]

Lectures

^[8]

Adriaan de Groot (1989). Some Special Benefits of Advances in Computer Chess.
Hans Berliner, Gordon Goetsch, Murray Campbell, Carl Ebeling (1989). Measuring the Performance Potential of Chess Programs.
Ingo Althöfer (1989). An Incremental Negamax Algorithm.
Helmut Horacek (1989). Reasoning with Uncertainty in Computer Chess.
Don Beal (1989). Experiments with the Null Move.
Maarten van der Meulen (1989). Weight Assessment in Evaluation Functions.
Dap Hartmann (1989). Notions of Evaluation Functions Tested against Grandmaster Games.
Reiner Seidel (1989). A Model of Chess Knowledge - Planning Structures and Constituent Analysis.
Hermann Kaindl (1989). Towards a Theory of Knowledge.
Andy Walker (1989). Interactive Solution of King and Pawn Endings.
Jonathan Schaeffer (1989). Conspiracy Numbers.
Paolo Ciancarini, Mauro Gaspari (1989). A knowledge-based system and development interface for the middlegame in chess. zipped postscript
László Lindner (1989). Performance Improvements in Problem-Solving Programs since 1984.
Ingo Althöfer (1989). Generalized Minimax Algorithms are no Better Error Correctors than Minimax Itself.
Hans Berliner (1989). Some Innovations Introduced by Hitech.
Sito Dekker, Jaap van den Herik, Bob Herschberg (1989). Perfect Knowledge and Beyond.
Roger Hünen (1989). Efficient Pattern Recognition in Large Game Trees.

Reports

Peter Kouwenhoven (1987). Advances in Computer Chess, The 5th Triennial Conference. ICCA Journal, Vol. 10, No. 2

External Links

Leeuwenhorst - Wikipedia.nl (Dutch)
Leeuwenhorst from Hotels.nl

References

^ Peter Kouwenhoven (1987). Advances in Computer Chess, The 5th Triennial Conference. ICCA Journal, Vol. 10, No. 2 (report)
^ Image by Michiel1972,CC BY-SA 4.0, Wikimedia Commons, Leeuwenhorst - Wikipedia.nl (Dutch)
^ Advances in Computer Chess 5 from openlibrary.org
^ Advances in Computer Chess 5 from amazon.com
^ Photo by László Lindner, ICCA Journal, Vol. 10, No. 3, pp. 144
^ Photo by László Lindner, ICCA Journal, Vol. 10, No. 3, pp. 138
^ Photo by László Lindner, ICCA Journal, Vol. 10, No. 3, pp. 117
^ Advances in Computer Chess 5 from Paul Verhelst' Computer Chess Sites

What links here?

Page	Date Edited
Abyss	Aug 5, 2017
Adriaan de Groot	Oct 6, 2014
Advances in Computer Chess 4	Jan 22, 2018
Advances in Computer Chess 5	Dec 2, 2017
Advances in Computer Chess 6	Dec 17, 2016
Andy Walker	Dec 9, 2016
Arachne	May 22, 2016
Automated Tuning	Feb 27, 2018
Bob Herschberg	Dec 13, 2016
Carl Ebeling	May 23, 2016
Chess Problems, Compositions and Studies	Feb 19, 2018
Conferences	Dec 18, 2017
Conspiracy Numbers	Dec 29, 2017
Dap Hartmann	Jun 10, 2017
Delicate Brute	Jun 7, 2016
Don Beal	Jul 27, 2017
Endgame Tablebases	Mar 6, 2018
Eugen	Jan 7, 2016
Evaluation	Feb 1, 2018
Evaluation Overlap	Jul 19, 2016
Gordon Goetsch	Jan 7, 2016
Hans Berliner	Jun 10, 2017
Helmut Horacek	Oct 31, 2016
Hermann Kaindl	Oct 31, 2016
HiTech	Mar 31, 2018
ICGA Journal	Dec 21, 2017
Ingo Althöfer	May 4, 2017
Jaap van den Herik	Sep 18, 2017
Jaap van Oosterwijk Bruyn	May 22, 2016
Jonathan Schaeffer	Jan 29, 2018
Knowledge	Jul 22, 2017
László Lindner	Sep 2, 2017
Maarten van der Meulen	Dec 13, 2016
Match Statistics	Mar 31, 2018
Mephisto Best-Publication Awards to Include	Dec 8, 2016
Michael Gherrity	May 8, 2015
Murray Campbell	Jun 2, 2017
Nimzo	Dec 30, 2017
Null Move Observation	Dec 30, 2015
Null Move Pruning	Dec 2, 2017
Oracle	Sep 4, 2016
Paolo Ciancarini	Dec 28, 2016
Pattern Recognition	Sep 8, 2017
Pawn Endgame	Oct 11, 2017
Peter Kouwenhoven	Jan 7, 2016
Planning	Feb 12, 2018
Playing Strength	Mar 31, 2018
Quiescence Search	Aug 19, 2017
Reiner Seidel	May 23, 2016
Roger Hünen	Apr 1, 2016
SAL	Dec 7, 2017
Sito Dekker	Apr 25, 2016

Up one Level

Advances in Computer Chess 6

GerdIsenberg — Sat, 17 Dec 2016 10:05:37 GMT

Home * Conferences * Advances in Computer Chess 6
< Prev Next >

The 6th Advances in Computer Chess Conference was held at Queen Mary & Westfield College, London, United Kingdom, on August 23 and 24, 1990, in connection with the 2nd Computer Olympiad. ACC is the conference of the ICCA.

Proceedings

Advances in Computer Chess 6
Don Beal, Editor Juli 1991
(Ellis Horwood Series in Artificial Intelligence)
ISBN-13: 978-0130065377

Synopsis

^[1]
This book is based on the proceedings of the latest international conference on computer chess which was held in London in August 1990. It includes discussions on search algorithms, evaluation techniques, learning by simulated genetic evolution, computer composition of elegant chess problems, and looks at attempts to use human-like pattern recognition in place of brute-force computation. Aimed at a wide readership it will be of interest not only to the scientific community in artificial intelligence and cognition but also to chess players and those who create their own chess-playing programs - whether for competitive purposes or as a hobby.

Lectures

^[2]

Rainer Feldmann, Peter Mysliwietz, Burkhard Monien (1991). A Fully Distributed Chess Program. pdf
Mikhail Donskoy (1991). Fundamental Concepts in Search.
Ingo Althöfer (1991). Selective trees and majority systems: two experiments with commercial chess computers.
Dap Hartmann, Peter Kouwenhoven (1991). Sundry Computer Chess Topics.
Victor Allis, Maarten van der Meulen, Jaap van den Herik (1991). Conspiracy-Number Search.
László Lindner, Michael Schlosser (1991). New Ideas in Problem Solving and Composing Programs.
Michael Schlosser (1991). Can a Computer Compose Chess Problems?
Michael George, Jonathan Schaeffer (1991). Chunking for Experience.
Nico Kuijf, Peter van Diepen (1991). Chess Database instead of Chess Literature.
John Roycroft, Don Beal (1991). To Make Dumb Endgame Databases Speak.
Alex van Tiggelen, Jaap van den Herik (1991). ALEXS: An Optimization Approach for the Endgame KNNKP(h).
Hans Berliner, Danny Kopec, Ed Northam (1991). A taxonomy of concepts for evaluating chess strength: examples from two difficult categories. pdf preprint

Reports

Paul Lu (1990). Report on the Advances in Computer Chess 6 Conference. ICCA Journal, Vol. 13, No. 3

References

^ Advances in Computer Chess 6 from amazon.de
^ Re: 2nd Computer Olympiad --- Chess results by Jonathan Schaeffer, rgc, August 27, 1990

What links here?

Page	Date Edited
2nd Computer Olympiad	Jul 12, 2017
Advances in Computer Chess 5	Dec 2, 2017
Advances in Computer Chess 6	Dec 17, 2016
Advances in Computer Chess 7	Oct 28, 2014
Alex van Tiggelen	May 4, 2013
Alexs	Dec 7, 2017
Burkhard Monien	Dec 19, 2016
Butterfly Boards	Jan 27, 2015
Butterfly Heuristic	May 6, 2016
Chess	Jan 21, 2018
Chess Problems, Compositions and Studies	Feb 19, 2018
Chunking	Jun 12, 2017
Cognition	Dec 8, 2017
Conferences	Dec 18, 2017
Conspiracy Numbers	Dec 29, 2017
Countermove Heuristic	Oct 1, 2017
Danny Kopec	Oct 1, 2016
Dap Hartmann	Jun 10, 2017
Databases	Mar 18, 2018
De Bruijn sequence	Feb 20, 2018
Don Beal	Jul 27, 2017
Ed Northam	Sep 4, 2016
Endgame Tablebases	Mar 6, 2018
Hans Berliner	Jun 10, 2017
ICGA Journal	Dec 21, 2017
Ingo Althöfer	May 4, 2017
Jaap van den Herik	Sep 18, 2017
John Roycroft	Apr 24, 2016
Jonathan Schaeffer	Jan 29, 2018
László Lindner	Sep 2, 2017
Maarten van der Meulen	Dec 13, 2016
Match Statistics	Mar 31, 2018
Michael George	Jan 3, 2016
Michael Schlosser	Nov 15, 2016
Mikhail Donskoy	Dec 23, 2017
Move Ordering	Feb 27, 2018
Nico Kuijf	Jul 16, 2017
Parallel Search	Dec 30, 2017
Paul Lu	Dec 13, 2016
Peter Kouwenhoven	Jan 7, 2016
Peter Mysliwietz	Mar 5, 2017
Peter van Diepen	Nov 5, 2015
Playing Strength	Mar 31, 2018
Queen Mary, University of London	Jul 12, 2017
Rainer Feldmann	Dec 19, 2016
Retrograde Analysis	Mar 21, 2017
Transputer	Apr 30, 2015
Victor Allis	Dec 19, 2016
Young Brothers Wait Concept	Apr 22, 2018
Zugzwang (Program)	Dec 19, 2016

Up one Level

Advances in Computer Chess 7

GerdIsenberg — Tue, 28 Oct 2014 16:24:12 GMT

Home * Conferences * Advances in Computer Chess 7
< Prev Next >

The 7th Advances in Computer Chess Conference was held at the University of Limburg at Maastricht in the Netherlands, on July 1-2, 1993. ACC is the conference of the ICCA.

Proceedings

Advances in Computer Chess 7 ^[1]
Jaap van den Herik, Bob Herschberg and Jos Uiterwijk (eds.) (1994).
Computer Science Department
Universiteit Maastricht,
ISBN 9062161014

For ordering information, contact Joke Hellemons

Lectures

Mikhail Botvinnik, Evgeniĭ Dmitrievich Cherevik, Vasily Vladimirov, Vitaly Vygodsky (1994). Solving Shannon's Problem: Ways and Means.
John Nunn (1994). Extracting Information from Endgame Databases.
Fernand Gobet, Peter Jansen (1994). Towards a Chess Program Based on a Model of Human Memory.
Hiroyuki Iida, Jos Uiterwijk, Jaap van den Herik, Bob Herschberg (1994). Thoughts on the Application of Opponent-Model Search.
Jos Uiterwijk, Jaap van den Herik (1994). Speculative Play in Computer Chess.
Boris Stilman (1994). A Linguistic Geometry of the Chess Model. pdf draft
Andreas L. Opdahl, Bjørnar Tessem (1994). Long-Term Planning in Computer Chess.
Robert Lake, Jonathan Schaeffer, Paul Lu (1994). Solving Large Retrograde Analysis Problems Using a Network of Workstations.
Jean-Christophe Weill (1994). How Hard is the Correct Coding of an Easy Endgame? zipped ps
Christian Posthoff, Michael Schlosser, Rainer Staudte, Jens Zeidler (1994). Transformations of Knowledge.
Rainer Feldmann, Peter Mysliwietz, Burkhard Monien (1994). Game-Tree Search on a Massively Parallel System.
Wim Pijls, Arie de Bruin (1994). Generalizing Alpha-Beta.
Alexander Reinefeld (1994). A Minimax Algorithm Faster than Alpha-Beta.
Dennis Breuker, Victor Allis, Jaap van den Herik (1994). How to Mate: Applying Proof-Number Search. ^[2]
Don Beal, Martin C. Smith (1994). Random Evaluations in Chess.
Ingo Althöfer, Chrilly Donninger, Ulf Lorenz, Valentin Rottmann (1994). On Timing, Permanent Brain and Human Intervention.
Christian Posthoff, Rainer Staudte, Michael Schlosser (1994). Chess Programming and Computer-Science Education.

Forum Posts

Re: Botvinnik article by Marc-François Baudot, rgcc, November 07, 1996

Reports

Christian Posthoff, Michael Schlosser (1993). Advances in Computer Chess Conference 7. ICCA Journal, Vol. 16, No. 3

References

^ Books at sale at ICGA
^ reprinted as Mate in 38: Applying Proof-Number Search from Ed Schröder's Programmer's Stuff site

What links here?

Page	Date Edited
0x88	Nov 28, 2016
Advances in Computer Chess 6	Dec 17, 2016
Advances in Computer Chess 7	Oct 28, 2014
Advances in Computer Chess 8	Jun 26, 2017
Alexander Reinefeld	Jul 4, 2016
Andreas L. Opdahl	May 23, 2016
Arie de Bruin	May 23, 2016
Bjørnar Tessem	Apr 5, 2014
Bob Herschberg	Dec 13, 2016
Boris Stilman	Apr 30, 2015
Burkhard Monien	Dec 19, 2016
CC Sapiens	Oct 29, 2014
Chess	Jan 21, 2018
CHREST	May 6, 2016
Chrilly Donninger	Dec 19, 2016
Christian Posthoff	Dec 19, 2016
Chump	Jan 31, 2016
Chunking	Jun 12, 2017
Cognition	Dec 8, 2017
Conferences	Dec 18, 2017
Dennis Breuker	Dec 19, 2016
Distance	Sep 25, 2015
Don Beal	Jul 27, 2017
Duck	Dec 12, 2016
Endgame	Sep 18, 2017
Endgame Tablebases	Mar 6, 2018
EPAM	Jul 15, 2017
Evgeniĭ Dmitrievich Cherevik	Oct 30, 2014
Eye Movements	Jul 22, 2015
Fernand Gobet	May 11, 2017
Fill Algorithms	Nov 6, 2013
Hiroyuki Iida	Aug 11, 2017
ICGA Journal	Dec 21, 2017
Ingo Althöfer	May 4, 2017
Jaap van den Herik	Sep 18, 2017
Jean-Christophe Weill	Dec 17, 2016
Jens Zeidler	Apr 30, 2015
John Nunn	Dec 9, 2017
Jonathan Schaeffer	Jan 29, 2018
Jos Uiterwijk	Aug 11, 2017
Knowledge	Jul 22, 2017
Learning	Feb 20, 2018
Maastricht University	May 15, 2017
Martin C. Smith	May 23, 2016
Mate Search	Oct 22, 2016
Memory	Dec 8, 2017
Michael Schlosser	Nov 15, 2016
Mikhail Botvinnik	Jul 15, 2017
Mobility	Jan 17, 2018
Opponent Model Search	Aug 14, 2017
Paul Lu	Dec 13, 2016
Peter Jansen	Jan 31, 2016
Peter Mysliwietz	Mar 5, 2017
Pioneer	Dec 23, 2017
Planning	Feb 12, 2018
Pondering	Dec 9, 2017
Proof-number search	Jan 22, 2018
Pseudorandom number generator	May 11, 2017
Rainer Feldmann	Dec 19, 2016
Rainer Staudte	Apr 26, 2014
Réti Endgame Study	Feb 25, 2014
Retrograde Analysis	Mar 21, 2017
Rob Lake	Dec 5, 2016
Search Pathology	Nov 26, 2017
Search with Random Leaf Values	Apr 23, 2018
SSS* and Dual*	Jan 22, 2018
Strategy	Jan 18, 2018
Time Management	Mar 20, 2018
Trajectory	Jan 3, 2015
Ulf Lorenz	Dec 22, 2016
Valentin Rottmann	Jan 7, 2016
Vasily Vladimirov	Oct 29, 2014
Vector Attacks	Dec 15, 2017
Victor Allis	Dec 19, 2016
Vitaly Vygodsky	Oct 29, 2014
Wim Pijls	May 23, 2016
Young Brothers Wait Concept	Apr 22, 2018
Zugzwang (Program)	Dec 19, 2016

Up one Level

Advances in Computer Chess 8

GerdIsenberg — Mon, 26 Jun 2017 20:01:29 GMT

Home * Conferences * Advances in Computer Chess 8
< Prev Next >

		The 8th Advances in Computer Chess Conference was hosted by the University of Maastricht and held at Vaeshartelt Castle ^[1] in Maastricht, the Netherlands, on June 27 and 28, 1996. ACC is the conference of the ICCA. Invited speaker Ken Thompson talked about 6-Piece endgames, gave away his last ten endgame tablebase cd-roms and was officially out of business. Beside other interesting lectures, Arie de Bruin declared SSS* "dead".
Vaeshartelt Castle ^[2]

Conference Proceedings

Conference Proceedings

Advances in Computer Chess 8 ^[3]
Jaap van den Herik and Jos Uiterwijk (eds.) (1997).
Computer Science Department
Universiteit Maastricht,
ISBN 9062162347

Lectures

Ken Thompson (1997). 6-Piece Endgames.
David Bronstein (1997). My Experiences with Computers.
S. D. Milner, Andrew N. Walker (1997). Heuristics and Loops in KQKR.
Andreas Junghanns, Jonathan Schaeffer, Mark Brockington, Yngvi Björnsson, Tony Marsland (1997). Diminishing Returns for Additional Search in Chess. pdf
Mark Brockington, Jonathan Schaeffer (1997). APHID Game-Tree Search.
Arie de Bruin, Wim Pijls (1997). SSS†.
Rainer Feldmann (1997). Fail-High Reductions. CiteSeerX
Ulf Lorenz, Valentin Rottmann (1997). Parallel Controlled Conspiracy-Number Search.
Hiroyuki Iida, Yoshiyuki Kotani, Jos Uiterwijk, Jaap van den Herik (1997). Gains and Risks of OM Search.
Yngvi Björnsson, Tony Marsland, Jonathan Schaeffer, Andreas Junghanns (1997). Searching with Uncertainty Cut-offs. pdf
Peter Mysliwietz (1997). A Metric for Evaluation Functions.
Dennis Breuker, Jos Uiterwijk, Jaap van den Herik (1997). Information in Transposition Tables.
Jonathan Allen, Edward Hamilton, Robert Levinson (1997). New Advances in Adaptive Pattern-Oriented Chess.
Eduardo F. Morales (1997). On Learning How to Play. CiteSeerX
Santos Gerardo Lazzeri, Rachelle Heller (1997). Application of Fuzzy Logic and Case-Based Reasoning to the Generation of High-Level Advice in Chess.
Rainer Staudte (1997). Constraints for Solving Helpmates.
Paolo Ciancarini, Francesco Dalla Libera, F. Maran (1997). Decision Making under Uncertainty: A Rational Approach to Kriegspiel. pdf
M. Hirose, Hitoshi Matsubara, T. Itoh (1997). The Composition of Tsume-Shogi Problems.

Exhibition Games

Invited Grandmaster David Bronstein talked about his experience with (chess) computers, and played two exhibition games against the reigning World Microcomputer Champion MChess Pro 5.0 by Marty Hirsch, represented by distributor Martin Stamer and operated by Gerd Isenberg. Bronstein drew the first game with the black pieces in a Scandinavian and won the second game, which was a French Defence.

[Event "ACC8 Exhibition Match"]
[Site "Vaeshartelt Castle, Maastricht"]
[Date "1996.06.27"]
[Round "1"]
[White "MChess Pro 5.0"]
[Black "David Bronstein"]
[Result "1/2-1/2"]
 
1.e4 d5 2.exd5 Qxd5 3.Nc3 Qd6 4.d4 Nf6 5.Bg5 a6 6.Nf3 Nbd7 7.Qd2 b5 8.a4 b4
9.Na2 e6 10.Bf4 Qb6 11.Be2 Bb7 12.O-O Be7 13.c3 bxc3 14.bxc3 c5 15.Rab1 Qa7
16.Ne5 O-O 17.Nxd7 Nxd7 18.Qe3 Nf6 19.Rbd1 Rfd8 20.Be5 Bc6 21.a5 cxd4 22.cxd4
Bb5 23.Qf3 Bxe2 24.Qxe2 Rac8 25.Rfe1 Nd5 26.Rdb1 Rc6 27.Qg4 Bf8 1/2-1/2
 
[Event "ACC8 Exhibition Match"]
[Site "Vaeshartelt Castle, Maastricht"]
[Date "1996.06.27"]
[Round "2"]
[White "David Bronstein"]
[Black "MChess Pro 5.0"]
[Result "1-0"]
 
1.e4 e6 2.d4 d5 3.Nc3 Bb4 4.Ne2 dxe4 5.a3 Bxc3 6.Nxc3 Nc6 7.Bb5 Ne7 8.Bg5 f6
9.Be3 0-0 10.Qd2 f5 11.0-0-0 a6 12.Be2 Rb8 13.f3 exf3 14.gxf3 b5 15.Rhg1 b4
16.axb4 Nxb4 17.Bh6 Ng6 18.Bg5 Qd6 19.h4 c5 20.h5 Qxd4 21.Qxd4 cxd4 22.Rxd4
Ne5 23.Be7 Nbc6 24.Bxf8 Nxd4 25.Bxg7 Nxe2 26.Nxe2 Nxf3 27.Rg3 Kf7 28.Bc3 Nh2
29.Rg7 Kf8 30.Rxh7 Ng4 31.Nf4 e5 32.Ng6 Kg8 33.Re7 f4 34.Nxe5 Nxe5 35.Bxe5
Rb5 36.h6 Bf5 37.Rg7 Kh8 38.Bc3 f3 39.h7 Rc5 40.Rc7 Rxc3 41.Rxc3 1-0

Games and short analyze on Lichess.org : game 1, game 2

Reports

Yngvi Björnsson, Mark Brockington, Andreas Junghanns, Aske Plaat (1996). Report on the Advances in Computer Chess 8 Conference. ICCA Journal, Vol. 19, No. 3
Dennis Breuker, Jaap van den Herik (1996). The Exhibition Games.
Jaap van den Herik (1996). Two Interviews with Ken Thompson.

Forum Posts

ICCAJ v.19 n.2 now in North America by Steven Edwards, rgcc, July 03, 1996
Re: ICCAJ v.19 n.2 now in North America by Dennis Breuker, rgcc, July 09, 1996

External Links

Vaeshartelt - Kasteel Vaeshartelt

References

What links here?

Page	Date Edited
Advances in Computer Chess 7	Oct 28, 2014
Advances in Computer Chess 8	Jun 26, 2017
Advances in Computer Games 9	Nov 15, 2016
Alexander Reinefeld	Jul 4, 2016
Analog Evaluation	Oct 27, 2017
Andreas Junghanns	Jun 26, 2017
Andy Walker	Dec 9, 2016
APHID	Jun 26, 2017
Arie de Bruin	May 23, 2016
Artificial Intelligence	Apr 9, 2018
Aske Plaat	Jun 26, 2017
Chess Problems, Compositions and Studies	Feb 19, 2018
Cognition	Dec 8, 2017
Conferences	Dec 18, 2017
Connectivity	Mar 6, 2016
Conspiracy Numbers	Dec 29, 2017
David Bronstein	Oct 28, 2014
Dennis Breuker	Dec 19, 2016
Depth	Feb 25, 2018
Eduardo F. Morales	May 23, 2016
Edward Hamilton	Aug 25, 2016
Endgame Tablebases	Mar 6, 2018
Evaluation	Feb 1, 2018
Fail-High Reductions	Mar 6, 2014
Hiroyuki Iida	Aug 11, 2017
Hitoshi Matsubara	Feb 7, 2017
ICGA Journal	Dec 21, 2017
Jaap van den Herik	Sep 18, 2017
Jonathan Schaeffer	Jan 29, 2018
Jos Uiterwijk	Aug 11, 2017
Ken Thompson	Sep 8, 2017
KriegSpiel	Sep 5, 2017
Learning	Feb 20, 2018
M-20	Oct 9, 2013
Maastricht University	May 15, 2017
Mark Brockington	Jun 26, 2017
Mobility	Jan 17, 2018
Morph	Dec 7, 2017
Null Move Observation	Dec 30, 2015
Opponent Model Search	Aug 14, 2017
Othello	Jan 4, 2018
P.ConNerS	Dec 22, 2016
Paolo Ciancarini	Dec 28, 2016
Parallel Search	Dec 30, 2017
Peter Mysliwietz	Mar 5, 2017
ProbCut	Mar 25, 2016
Rachelle Heller	Jun 26, 2017
Rainer Feldmann	Dec 19, 2016
Rainer Staudte	Apr 26, 2014
Robert Levinson	Aug 25, 2016
Santos Gerardo Lazzeri	Mar 19, 2016
Shogi	Feb 19, 2018
SSS* and Dual*	Jan 22, 2018
The Turk	Apr 1, 2017
Thompson's Databases	Dec 24, 2014
Tony Marsland	Nov 27, 2017
Tournaments	Dec 21, 2017
Transposition Table	Apr 19, 2018
Ulf Lorenz	Dec 22, 2016
Ulysses	Nov 1, 2016
Uncertainty Cut-Offs	Jul 21, 2015
Valentin Rottmann	Jan 7, 2016
Wim Pijls	May 23, 2016
Yngvi Björnsson	Jun 26, 2017
Yoshiyuki Kotani	Dec 27, 2016
Zugzwang (Program)	Dec 19, 2016

Up one Level

Advances in Computer Games 10

GerdIsenberg — Fri, 30 Dec 2016 17:31:50 GMT

Home * Conferences * Advances in Computer Games 10
< Prev Next >

		The 10th Advances in Computer Games Conference (ACG) took place at November 24-27, 2003, in Dom im Berg in Graz, European Capital of Culture in 2003, Austria, in conjunction with the 11th World Computer Chess Championship and the 8th Computer Olympiad. ACG is the conference of the ICGA.
Dom im Berg ^[1]

Photos

Conference Proceedings

Photos

Conference in the cave ^[2]

Conference Proceedings

Advances in Computer Games 10
Jaap van den Herik, Hiroyuki Iida and Ernst A. Heinz (eds.) (2004)
Series: IFIP Advances in Information and Communication Technology, Vol. 135
ISBN: 978-1-4020-7709-8

Lectures

Dave Gomboc, Tony Marsland, Michael Buro (2003). Evaluation Function Tuning via Ordinal Correlation. University of Alberta, Edmonton, Alberta, Canada, pdf
Albert Xin Jiang, Michael Buro (2003). First Experimental Results of ProbCut Applied to Chess. pdf
Aleksander Sadikov, Ivan Bratko, and Igor Kononenko (2003). Search versus Knowledge: An Empirical Study of Minimax on KRK. pdf
Darse Billings, Yngvi Björnsson (2003). Search and Knowledge in Lines of Action. pdf
Jens Lieberum (2003). An Evaluation Function for the Game of Amazons.
Jeroen Donkers, Jaap van den Herik, and Jos Uiterwijk (2003). Opponent Models in Bao: Conditions of a Successfull Application. pdf
Akihiro Kishimoto, Martin Müller. (2003). Df-pn in Go: An Application to the One-Eye Problem. pdf.
Ryan Hayward, Yngvi Björnsson, Michael Johanson, Morgan Kan, Nathan Po and Jack van Rijswijck (2003). Solving 7x7 Hex: Virtual Connections and Game-state Reduction. pdf
Jonathan Schaeffer, Yngvi Björnsson, Neil Burch, Robert Lake, Paul Lu, and Steve Sutphen (2003). Building the Checkers 10-Piece Endgame Databases. pdf
Ed Trice, Gil Dodgen (2003). The 7-Piece Perfect Play Lookup Database for the Game of Checkers.
Markus Enzenberger (2003). Evaluation in Go by a Neural Network using Soft Segmentation. pdf
Bruno Bouzy, Bernard Helmstetter (2003). Monte Carlo Go Developments. pdf
Bernard Helmstetter, Tristan Cazenave (2003). Searching with analysis of dependencies in a solitaire card game. pdf
Andrea Bolognesi, Paolo Ciancarini (2003). Computer Programming of Kriegspiel Endings: The Case of KR vs. K. pdf
John Tamplin, Guy Haworth (2003). Chess Endgames: Data and Strategy.
Guy Haworth, Rafael B. Andrist (2003). Model Endgame Analysis.
Tomoyuki Kaneko, Kazunori Yamaguchi, Satoru Kawai (2003). Automated Identification of Patterns in Evaluation Functions for General Game Players.

Reports

Jan Renze Steenhuisen (2003). Report on the 10th Advances in Computer Games Conference. ICGA Journal, Vol. 26, No. 4, pdf

External Links

References

^ [http://icga.leidenuniv.nl/icga/news/Olympiad/Olympiad2003/fotos/graz_web/|ICGA Images Graz 2003 - 03.jpg]]
^ Computer Olympiad 2003 in Graz, Austria, November 25 by Hiroshi Yamashita

What links here?

Page	Date Edited
8th Computer Olympiad	Jul 22, 2017
Advances in Computer Games 10	Dec 30, 2016
Advances in Computer Games 11	Dec 27, 2016
Advances in Computer Games 9	Nov 15, 2016
Akihiro Kishimoto	Jan 22, 2018
Albert Xin Jiang	Jun 22, 2015
Aleksander Sadikov	Jan 2, 2017
Amazons	Aug 12, 2017
Automated Tuning	Feb 27, 2018
Bao	Dec 23, 2016
Bernard Helmstetter	May 23, 2016
Bruno Bouzy	Aug 12, 2017
Checkers	Dec 23, 2017
Computer Olympiad	Mar 6, 2018
Conferences	Dec 18, 2017
Darse Billings	Feb 14, 2017
Dave Gomboc	May 6, 2015
Ed Trice	Feb 21, 2018
Endgame Tablebases	Mar 6, 2018
Ernst A. Heinz	Mar 6, 2017
Evaluation Patterns	Jun 24, 2013
General Game Playing	Dec 22, 2017
Gil Dodgen	Mar 1, 2017
Go	Jan 24, 2018
Guy Haworth	Nov 20, 2017
Hex	Dec 29, 2017
ICGA Journal	Dec 21, 2017
Igor Kononenko	May 23, 2016
Ivan Bratko	Aug 16, 2017
Jaap van den Herik	Sep 18, 2017
Jack van Rijswijck	Dec 22, 2016
Jan Renze Steenhuisen	Sep 10, 2017
Jens Lieberum	Jan 2, 2017
Jeroen Donkers	Dec 23, 2016
John Tamplin	Jan 9, 2017
Jonathan Schaeffer	Jan 29, 2018
Jos Uiterwijk	Aug 11, 2017
Kazunori Yamaguchi	Jun 20, 2016
Knowledge	Jul 22, 2017
KriegSpiel	Sep 5, 2017
KRK	Nov 26, 2016
Learning	Feb 20, 2018
Lines of Action	Feb 5, 2018
Markus Enzenberger	May 23, 2016
Martin Müller	Aug 12, 2017
Michael Buro	Dec 21, 2016
Michael Johanson	Jan 10, 2018
Monte-Carlo Tree Search	Apr 26, 2018
Neil Burch	Jan 10, 2018
Neural Networks	Mar 12, 2018
Opponent Model Search	Aug 14, 2017
Paolo Ciancarini	Dec 28, 2016
Paul Lu	Dec 13, 2016
ProbCut	Mar 25, 2016
Proof-number search	Jan 22, 2018
Rafael B. Andrist	May 30, 2017
Rob Lake	Dec 5, 2016
Ryan Hayward	Dec 29, 2017
Satoru Kawai	Jun 20, 2016
Steve Sutphen	Jan 3, 2014
Tomoyuki Kaneko	Oct 25, 2017
Tony Marsland	Nov 27, 2017
Tristan Cazenave	Jan 22, 2018
WCCC 2003	Apr 2, 2017
Wilhelm	Oct 6, 2015
Yngvi Björnsson	Jun 26, 2017

Up one Level

Advances in Computer Games 11

GerdIsenberg — Tue, 27 Dec 2016 21:34:30 GMT

Home * Conferences * Advances in Computer Games 11
< Prev Next >

		The 11th Advances in Computer Games was held from September 6 - 8, 2005, at the Institute of Information Science, Academia Sinica, Taipei, Taiwan, in conjunction with the 10th Computer Olympiad ^[1]. The Advances in Computer Games Conference (ACG), formerly known as the Advances in Computer Chess Conference, is organized by the International Computer Games Association. The objective of the conference is to provide an international forum for researchers in the field of Artificial Intelligence, as applied to computer games, to present the latest results of their ongoing work. This bi-annual forum has a long and reputable history in the field of computer games.
Institute of Information Science ^[2]

Proceedings

		Jaap van den Herik, Shun-Chin Hsu, Tsan-sheng Hsu, Jeroen Donkers (eds.) Advances in Computer Games ^[3] 11th International Conference, ACG 2005 Taipei, Taiwan, Septermber 6-8, 2005 Lecture Notes in Computer Science, Volume 4250, 2006 Springer Berlin / Heidelberg ISBN 978-3-540-48887-3

Lectures

^[4]

Chrilly Donninger, Ulf Lorenz (2005). Innovative Opening-Book Handling. Advances in Computer Games 11, pdf
Yngvi Björnsson, Jonathan Schaeffer, Nathan Sturtevant (2005). Partial Information Endgame Databases. Advances in Computer Games 11, pdf, pdf
Markian Hlynka, Jonathan Schaeffer (2005). Automatic Generation of Search Engines. Advances in Computer Games 11
Levente Kocsis, Csaba Szepesvári, Mark Winands (2005). RSPSA: Enhanced Parameter Optimization in Games. Advances in Computer Games 11, pdf
Jeroen Donkers, Jaap van den Herik, Jos Uiterwijk (2005). Similarity Pruning in PrOM Search. Advances in Computer Games 11
Yoshinori Higashiuchi, Reijer Grimbergen (2005). Enhancing Search Efficiency by Using Move Categorization Based on Game Progress in Amazons. Advances in Computer Games 11
Xiaozhen Niu, Akihiro Kishimoto, Martin Müller (2005). Recognizing Seki in Computer Go. Advances in Computer Games 11
Bruno Bouzy (2005). Move-Pruning Techniques for Monte-Carlo Go. Advances in Computer Games 11
Tristan Cazenave (2005). A Phantom-Go Program. Advances in Computer Games 11, pdf
Shunsuke Soeda, Tomoyuki Kaneko, Tetsuro Tanaka (2005). Dual Lambda Search and Shogi Endgames. Advances in Computer Games 11
Takeshi Ito, Hitoshi Matsubara, Reijer Grimbergen (2005). Chunking in Shogi: New Findings. Advances in Computer Games 11
Alejandro González Romero (2005). King Race. Advances in Computer Games 11
Kuang-che Wu, Shun-Chin Hsu, Tsan-sheng Hsu (2005). The Graph-History Interaction Problem in Chinese Chess. Advances in Computer Games 11
I-Chen Wu, Dei-Yen Huang (2005). A New Family of k -in-a-Row Games. Advances in Computer Games 11, pdf
Li-Te Huang, Shan-Tai Chen, Shun-Shii Lin (2005). Exact-Bound Analyzes and Optimal Strategies for Mastermind with a Lie. Advances in Computer Games 11
Ulf Lorenz, Tobias Tscheuschner (2005). Player Modeling, Search Algorithms and Strategies in Multi-player Games. Advances in Computer Games 11
Ling Zhao, Martin Müller (2005). Solving Probabilistic Combinatorial Games. Advances in Computer Games 11
Kuo-Yuan Kao (2005). On Colored Heap Games of Sumbers. Advances in Computer Games 11
Will Leckie, Michael Greenspan (2005). An Event-Based Pool Physics Simulator. Advances in Computer Games 11
Jean-Pierre Dussault, Jean-François Landry (2005). Optimization of a Billiard Player - Position Play. Advances in Computer Games 11

Invited Lectures

^[5]

Reports

Fredrik Niemelä (2005). The 11th Advances in Computer Games Conference. ICGA Journal, Vol. 28, No. 3 and BNVKI Newsletter, October 2005, pdf

External Links

References

^ ICGA CO 10 and ACG 11
^ Institute of Information Science, Academia Sinica, Taipei, Image from CO 10 and ACG 11, Pictures 09/12/2005
^ Advances in Computer Games 11, Books at sale at ICGA
^ Advances in Computer Games - Springer
^ CO 10 and ACG11 - Invited Lectures

What links here?

Page	Date Edited
10th Computer Olympiad	Jul 22, 2017
Advances in Computer Games 10	Dec 30, 2016
Advances in Computer Games 11	Dec 27, 2016
Advances in Computer Games 12	Jan 5, 2017
Akihiro Kishimoto	Jan 22, 2018
Alejandro González Romero	Feb 7, 2017
Amazons	Aug 12, 2017
Automated Tuning	Feb 27, 2018
Book Learning	Jan 1, 2017
Bruno Bouzy	Aug 12, 2017
Chinese Chess	Jan 16, 2018
Chrilly Donninger	Dec 19, 2016
Chunking	Jun 12, 2017
Cognition	Dec 8, 2017
Computer Olympiad	Mar 6, 2018
Conferences	Dec 18, 2017
Connect6	Jul 22, 2017
Csaba Szepesvári	May 23, 2016
Dei-Yen Huang	Jul 19, 2017
Endgame Tablebases	Mar 6, 2018
Feng-hsiung Hsu	Dec 27, 2016
Games	Feb 20, 2018
Go	Jan 24, 2018
Graph History Interaction	Oct 16, 2017
Hao Cui	Jun 29, 2017
Hiroyuki Iida	Aug 11, 2017
Hitoshi Matsubara	Feb 7, 2017
I-Chen Wu	Sep 19, 2017
ICGA Journal	Dec 21, 2017
Jaap van den Herik	Sep 18, 2017
Jeroen Donkers	Dec 23, 2016
Jonathan Schaeffer	Jan 29, 2018
Jos Uiterwijk	Aug 11, 2017
Kuang-Che Wu	Dec 26, 2016
Kuo-Yuan Kao	Jul 22, 2017
Learning	Feb 20, 2018
Levente Kocsis	Dec 23, 2016
Liang Li	Jun 29, 2017
Ling Zhao	Jun 24, 2015
Mark Winands	Sep 19, 2017
Markian Hlynka	Jun 10, 2015
Martin Müller	Aug 12, 2017
Michael Greenspan	Dec 29, 2016
Microsoft	Dec 27, 2016
Monte-Carlo Tree Search	Apr 26, 2018
Nathan Sturtevant	Oct 23, 2015
Opening Book	Feb 26, 2018
Opponent Model Search	Aug 14, 2017
Phantom Go	Jun 29, 2017
Reijer Grimbergen	Jan 4, 2017
Ruijian Wang	Jun 29, 2017
Search	Feb 1, 2018
Shogi	Feb 19, 2018
Shun-Chin Hsu	Jul 22, 2017
Shun-Shii Lin	Jan 21, 2017
Shunsuke Soeda	Oct 25, 2017
Siran Lin	Jun 29, 2017
SPSA	May 8, 2017
Takeshi Ito	Jan 6, 2017
Tetsuro Tanaka	Oct 25, 2017
Tobias Tscheuschner	Jun 10, 2015
Tomoyuki Kaneko	Oct 25, 2017
Tony Marsland	Nov 27, 2017
Tristan Cazenave	Jan 22, 2018
Tsan-sheng Hsu	Jul 17, 2017
Ulf Lorenz	Dec 22, 2016
WCCC 2005	Dec 27, 2016
Will Leckie	Dec 28, 2016
Yngvi Björnsson	Jun 26, 2017

Up one Level

Advances in Computer Games 12

GerdIsenberg — Thu, 05 Jan 2017 08:44:58 GMT

Home * Conferences * Advances in Computer Games 12
< Prev Next >

		The 12th Advances in Computer Games was held from May 11-13, 2009, at Palacio del Condestable, Pamplona, Navarre, Spain, in conjunction with the 17th World Computer Chess Championship and the 14th Computer Olympiad. ACG is the conference of the ICGA.
Palacio del Condestable ^[1]

Conference Proceedings

Conference Proceedings

Advances in Computer Games 12
Jaap van den Herik, Pieter Spronck (eds.) (2010)
Lecture Notes in Computer Science
Springer Berlin / Heidelberg
ISBN 978-3-642-12992-6

Lectures

Matej Guid, Martin Možina, Aleksander Sadikov, Ivan Bratko (2010). Deriving Concepts and Strategies from Chess Tablebases. pdf
Pálmi Skowronski, Yngvi Björnsson, Mark Winands (2010). Automated Discovery of Search-Extension Features. pdf » Search, Extensions
Markus Enzenberger, Martin Müller (2010). A lock-free multithreaded Monte-Carlo tree search algorithm. pdf » Monte-Carlo Tree Search
Guillaume Chaslot, Christophe Fiter, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud (2010). Adding Expert Knowledge and Exploration in Monte-Carlo Tree Search. pdf »
Fabien Teytaud, Olivier Teytaud (2010). Creating an Upper-Confidence-Tree program for Havannah. pdf » UCT, Havannah
Tristan Cazenave (2010). Monte-Carlo Kakuro. pdf
Philip Henderson, Broderick Arneson, Ryan Hayward (2010). Hex, Braids, the Crossing Rule, and XH-Search. pdf » Hex
Gerhard Trippen (2010). Plans, Patterns and Move Categories Guiding a Highly Selective Search. pdf » Arimaa
Jahn-Takeshi Saito, Mark Winands, Jaap van den Herik (2010). Randomized Parallel Proof-Number Search. pdf
Eiko Bleicher, Guy McCrossan Haworth (2010). 6-Man Chess and Zugzwangs.
Joe Hurd, Guy McCrossan Haworth (2010). Data Assurance in Opaque Computations. pdf
Guy McCrossan Haworth, Ken Regan, Giuseppe Di Fatta (2010). Performance and Prediction: Bayesian Modelling of Fallible Choice in Chess. pdf
Bo-Nian Chen, Pangfeng Liu, Shun-Chin Hsu, Tsan-sheng Hsu (2010). Conflict Resolution of Chinese Chess Endgame Knowledge Base.
Li-Te Huang, Shun-Shii Lin (2010). Optimal Analyses for 3×n AB Games in the Worst Case. pdf
István Szita, Guillaume Chaslot, Pieter Spronck (2010). Monte-Carlo Tree Search in Settlers of Catan. pdf ^[2]

Reports

Richard J. Lorentz (2009). The Advances in Computer Games Conference 2009. ICGA Journal, Vol. 32, No. 2
Dap Hartmann (2010). Human Superiority Restored. ICGA Journal, Vol. 33, No. 3, Review revised papers, edited by Jaap van den Herik and Pieter Spronck

External Links

References

What links here?

Page	Date Edited
14th Computer Olympiad	Jul 23, 2017
Advances in Computer Games 11	Dec 27, 2016
Advances in Computer Games 12	Jan 5, 2017
Advances in Computer Games 13	Jan 7, 2017
Aleksander Sadikov	Jan 2, 2017
Arimaa	Jan 4, 2017
Arpad Rimmel	Mar 16, 2016
Bo-Nian Chen	Jul 17, 2017
Broderick Arneson	Jan 8, 2017
Chinese Chess	Jan 16, 2018
Christophe Fiter	Jan 19, 2016
Computer Olympiad	Mar 6, 2018
Conferences	Dec 18, 2017
Connect6	Jul 22, 2017
Dap Hartmann	Jun 10, 2017
Eiko Bleicher	Apr 24, 2014
Endgame Tablebases	Mar 6, 2018
Extensions	Apr 19, 2018
Fabien Teytaud	Jul 8, 2016
Gerhard Trippen	Jun 8, 2015
Gert Vriend	Nov 1, 2013
Giuseppe Di Fatta	Aug 15, 2013
Guillaume Chaslot	Jan 2, 2017
Guy Haworth	Nov 20, 2017
Havannah	Jan 8, 2017
Hex	Dec 29, 2017
I-Chen Wu	Sep 19, 2017
ICGA Journal	Dec 21, 2017
Ingo Althöfer	May 4, 2017
István Szita	Aug 4, 2015
Ivan Bratko	Aug 16, 2017
Jaap van den Herik	Sep 18, 2017
Jahn-Takeshi Saito	Jan 2, 2017
Jean-Baptiste Hoock	Jan 2, 2017
Joe Leslie-Hurd	Aug 15, 2013
KBNK Endgame	Nov 26, 2016
Kenneth Wingate Regan	Feb 19, 2018
Knowledge	Jul 22, 2017
Mark Winands	Sep 19, 2017
Markus Enzenberger	May 23, 2016
Martin Možina	Jun 11, 2016
Martin Müller	Aug 12, 2017
Match Statistics	Mar 31, 2018
Matej Guid	Jan 6, 2018
Monte-Carlo Tree Search	Apr 26, 2018
Olivier Teytaud	Jan 7, 2017
Pálmi Skowronski	May 23, 2016
Pangfeng Liu	Feb 24, 2016
Parallel Search	Dec 30, 2017
Philip Henderson	Jan 6, 2017
Pieter Spronck	Jan 5, 2017
Ping-Hung Lin	Jul 19, 2017
Planning	Feb 12, 2018
Playing Strength	Mar 31, 2018
Proof-number search	Jan 22, 2018
Richard J. Lorentz	Aug 11, 2017
Ryan Hayward	Dec 29, 2017
Sheng-Hao Chiang	Apr 19, 2012
Shun-Chin Hsu	Jul 22, 2017
Shun-Shii Lin	Jan 21, 2017
Tristan Cazenave	Jan 22, 2018
UCT	Jan 22, 2018
WCCC 2009	Apr 2, 2017
Yngvi Björnsson	Jun 26, 2017
Zugzwang	Dec 8, 2017

Up one Level

Advances in Computer Games 13

GerdIsenberg — Sat, 07 Jan 2017 18:48:07 GMT

Home * Conferences * Advances in Computer Games 13
< Prev Next >

		Advances in Computer Games 13, from November 20 to 22, 2011, Tilburg University, Tilburg ^[1], The Netherlands. In conjunction with the 16th Computer Olympiad, the WCCC 2011, and the WCSC 2011.
The Red Brick, Tilburg University ^[2]

Proceedings

Jaap van den Herik, Aske Plaat (editors) (2012). Advances in Computer Games.
Lecture Notes in Computer Science, 7168
13th International Conference, ACG 2011, Revised Selected Papers

Lectures

Junichi Hashimoto, Akihiro Kishimoto, Kazuki Yoshizoe, Kokolo Ikeda (2011). Accelerated UCT and Its Application to Two-Player Games.
Gabriel Van Eyck, Martin Müller (2011). Revisiting Move Groups in Monte-Carlo Tree Search.
Petr Baudiš, Jean-Loup Gailly (2011). Pachi: State of the Art Open Source Go Program.
Hendrik Baier, Mark Winands (2011). Time Management for Monte-Carlo Tree Search in Go.
Richard J. Lorentz (2011). An MCTS Program to Play EinStein Würfelt Nicht!
Jan Stankiewicz, Mark Winands, Jos Uiterwijk (2011). Monte-Carlo Tree Search Enhancements for Havannah.
Pim Nijssen, Mark Winands (2011). Playout Search for Monte-Carlo Tree Search in Multi-Player Games.
Cheng-Wei Chou, Ping-Chiang Chou, Hassen Doghmen, Chang-Shing Lee, Tsan-Cheng Su, Fabien Teytaud, Olivier Teytaud, Hui-Ming Wang, Mei-Hui Wang, Li-Wen Wu, Shi-Jim Yen (2011). Towards a Solution of 7x7 Go with Meta-MCTS.
Bruno Bouzy, Marc Métivier, Damien Pellier (2011). MCTS Experiments on the Voronoi Game.
Jiao Wang, Shiyuan Li, Jitong Chen, Xin Wei, Huizhan Lv, Xinhe Xu (2011). 4*4-Pattern and Bayesian Learning in Monte-Carlo Go.
I-Chen Wu, Hsin-Ti Tsai, Hung-Hsuan Lin, Yi-Shan Lin, Chieh-Min Chang, Ping-Hung Lin (2011). Temporal Difference Learning for Connect6.
Nikolaos Papahristou, Ioannis Refanidis (2011). Improving Temporal Difference Performance in Backgammon Variants. pdf
Rémi Coulom (2011). CLOP: Confident Local Optimization for Noisy Black-Box Parameter Tuning.
Tomoyuki Kaneko, Kunihito Hoki (2011). Analysis of Evaluation-Function Learning by Comparison of Sibling Nodes.
Todd W. Neller, Steven Hnath (2011). Approximating Optimal Dudo Play with Fixed-Strategy Iteration Counterfactual Regret Minimization.
Kunihito Hoki, Tomoyuki Kaneko (2011). The Global Landscape of Objective Functions for the Optimization of Shogi Piece Values with a Game-Tree Search.
Abdallah Saffidine, Nicolas Jouandeau, Tristan Cazenave (2011). Solving breakthrough with Race Patterns and Job-Level Proof Number Search. » Breakthrough (Game)
Yoshiaki Yamaguchi, Kazunori Yamaguchi, Tetsuro Tanaka, Tomoyuki Kaneko (2011). Infinite Connect-Four Is Solved: Draw.
Henry Brausen, Ryan B. Hayward, Martin Müller, Abdul Qadir, David Spies (2011). Blunder Cost in Go and Hex.
Kenneth Wingate Regan, Bartłomiej Macieja, Guy McCrossan Haworth (2011). Understanding Distributions of Chess Performances.
Guy McCrossan Haworth, Árpád Rusz (2011). Position Criticality in Chess Endgames.
Ingo Althöfer (2011). On Board-Filling Games with Random-Turn Order and Monte Carlo Perfectness.
Thorsten Ederer, Ulf Lorenz, Thomas Opfer, Jan Wolf (2011). Modeling Games with the Help of Quantified Integer Linear Programs.
Sam Ganzfried (2011). Computing Strong Game-Theoretic Strategies in Jotto.
David L. St-Pierre, Quentin Louveaux, Olivier Teytaud (2011). Online Sparse Bandit for Card Games.
Hung-Jui Chang, Meng-Tsung Tsai, Tsan-sheng Hsu (2011). Game Tree Search with Adaptive Resolution.
Giuseppe Maggiore, Alvise Spanò, Renzo Orsini, Giulia Costantini, Michele Bugliesi, Mohamed Abbadi (2011). Designing Casanova: A Language for Games. ^[3]
Michael Lankes, Thomas Mirlacher (2011). Affective Game Dialogues.
Richard Zhao, Duane Szafron (2011). Generating Believable Virtual Characters Using Behavior Capture and Hidden Markov Models.

Reports

Jaap van den Herik, Aske Plaat (2012). The 13th Advances in Computer Games Conference. ICGA Journal, Vol. 35, No. 1
Ingo Althöfer (2012). Side Report: Popular Video Livestream. ICGA Journal, Vol. 35, No. 1

External Links

Events International Computer Games Association hosted in Tilburg (2011) - Tilburg University
Slides ACG13 Tilburg
ACG13 Photo Gallery
ACG13 - ConfTool Pro - BrowseSessions
Advances in Computer Games 13, 2011 | Facebook by Nikolaos Papahristou
Gaming and AI within Communication and Information Sciences, YouTube Video
Featuring Philip Eijlander, Jaap van den Herik ^[4] ^[5], David Levy, Aske Plaat, Richard Lorentz, I-Chen Wu, and Joke Hellemons

References

What links here?

Page	Date Edited
16th Computer Olympiad	Aug 12, 2017
Abdallah Saffidine	Aug 11, 2017
Advances in Computer Games 12	Jan 5, 2017
Advances in Computer Games 13	Jan 7, 2017
Advances in Computer Games 14	Aug 11, 2017
Akihiro Kishimoto	Jan 22, 2018
Alvise Spanò	May 3, 2014
Árpád Rusz	Oct 9, 2017
Aske Plaat	Jun 26, 2017
Automated Tuning	Feb 27, 2018
Backgammon	Dec 22, 2017
Bartłomiej Macieja	Jun 8, 2015
Breakthrough (Game)	Aug 11, 2017
Bruno Bouzy	Aug 12, 2017
Chang-Shing Lee	Jul 18, 2017
Cheng-Wei Chou	Jul 17, 2017
Chess Problems, Compositions and Studies	Feb 19, 2018
CLOP	Nov 24, 2016
Computer Olympiad	Mar 6, 2018
Conferences	Dec 18, 2017
Connect Four	Jan 31, 2018
Connect6	Jul 22, 2017
Dap Hartmann	Jun 10, 2017
David Levy	Jan 3, 2017
Duane Szafron	Feb 20, 2018
EinStein würfelt nicht!	Aug 11, 2017
Fabien Teytaud	Jul 8, 2016
Games	Feb 20, 2018
Giulia Costantini	May 4, 2014
Giuseppe Maggiore	May 3, 2014
Go	Jan 24, 2018
Guy Haworth	Nov 20, 2017
Hassen Doghmen	Mar 16, 2016
Havannah	Jan 8, 2017
Hendrik Baier	Jan 22, 2018
Hex	Dec 29, 2017
Hung-Hsuan Lin	Jul 22, 2017
Hung-Jui Chang	Jul 16, 2017
I-Chen Wu	Sep 19, 2017
ICGA Journal	Dec 21, 2017
Ingo Althöfer	May 4, 2017
Jaap van den Herik	Sep 18, 2017
Jan Wolf	Jul 8, 2016
Jean-Loup Gailly	Nov 27, 2011
Jiao Wang	Jan 3, 2017
Johanna Hellemons	Jan 8, 2017
Jos Uiterwijk	Aug 11, 2017
Junichi Hashimoto	Jan 4, 2017
Kazuki Yoshizoe	May 23, 2016
Kazunori Yamaguchi	Jun 20, 2016
Kenneth Wingate Regan	Feb 19, 2018
Kokolo Ikeda	Mar 15, 2016
Kunihito Hoki	Jul 9, 2016
Languages	Nov 26, 2017
Learning	Feb 20, 2018
Mark Winands	Sep 19, 2017
Martin Müller	Aug 12, 2017
Match Statistics	Mar 31, 2018
MCαβ	Jan 28, 2018
Mei-Hui Wang	Jul 17, 2017
Meng-Tsung Tsai	May 23, 2016
Michele Bugliesi	Jun 2, 2014
Mohamed Abbadi	May 3, 2014
Monte-Carlo Tree Search	Apr 26, 2018
NegaScout	Jul 6, 2016
Nicolas Jouandeau	Jun 29, 2017
Nikolaos Papahristou	Jan 7, 2017
Olivier Teytaud	Jan 7, 2017
Pattern Recognition	Sep 8, 2017
Petr Baudiš	Dec 9, 2017
Pim Nijssen	May 21, 2015
Ping-Chiang Chou	Jul 17, 2017
Ping-Hung Lin	Jul 19, 2017
Playing Strength	Mar 31, 2018
Point Value	Mar 31, 2018
Proof-number search	Jan 22, 2018
Rémi Coulom	Feb 5, 2018
Renzo Orsini	May 3, 2014
Richard J. Lorentz	Aug 11, 2017
Ryan Hayward	Dec 29, 2017
Search	Feb 1, 2018
Shi-Jim Yen	Jul 22, 2017
Shogi	Feb 19, 2018
Takuya Obata	Jan 7, 2017
Temporal Difference Learning	Feb 20, 2018
Tetsuro Tanaka	Oct 25, 2017
Thomas Opfer	May 7, 2014
Thorsten Ederer	Jul 8, 2016
Tilburg University	Jan 7, 2017
Time Management	Mar 20, 2018
Todd W. Neller	Aug 11, 2017
Tomoyuki Kaneko	Oct 25, 2017
Tristan Cazenave	Jan 22, 2018
Tsan-Cheng Su	Jan 8, 2017
Tsan-sheng Hsu	Jul 17, 2017
UCT	Jan 22, 2018
Ulf Lorenz	Dec 22, 2016
WCCC 2011	Jan 7, 2017
WCSC 2011	Jan 7, 2017
Xinhe Xu	Jan 3, 2017
Yoshiaki Yamaguchi	Dec 18, 2016

Up one Level

Advances in Computer Games 14

GerdIsenberg — Fri, 11 Aug 2017 19:48:48 GMT

Home * Conferences * Advances in Computer Games 14
< Prev Next >

		Advances in Computer Games 14, from July 1 to 3, 2015, Snellius Building ^[1] ^[2], Leiden University, Leiden, The Netherlands, in conjunction with the WCCC 2015, WCSC 2015, and the 18th Computer Olympiad. ACG is the conference of the ICGA.
Snellius Building ^[3]

Proceedings

Aske Plaat, Jaap van den Herik, Walter Kosters (editors) (2015). Advances in Computer Games.
Lecture Notes in Computer Science, 9525
14th International Conference, ACG 2015, Leiden, The Netherlands, July 1-3, 2015, Revised Selected Papers

Lectures

Day 1

Session 1

Richard J. Lorentz (2015). Early Playout Termination in MCTS. Advances in Computer Games 14
Tristan Cazenave (2015). Playout Policy Adaptation for Games. Advances in Computer Games 14
Tobias Graf, Marco Platzner (2015). Adaptive Playouts in Monte Carlo Tree Search with Policy Gradient Reinforcement Learning. Advances in Computer Games 14

Session 2

Ingo Althöfer, Matthias Beckmann, Friedrich Salzer (2015). On some Random Walk Games with Micro Control. Advances in Computer Games 14
Olivier Teytaud, Abdallah Saffidine, Shi-Jim Yen (2015). The complexities of Go. Advances in Computer Games 14

Session 3

Vito Janko, Matej Guid (2015). Development of a Program for Playing Progressive Chess. Advances in Computer Games 14 ^[4]
Guy Haworth, Tamal T. Biswas, Kenneth W. Regan (2015). A Comparative Review of Skill Assessment: Performance, Prediction and Profiling. Advances in Computer Games 14

Day 2

Session 4

Cameron Browne (2015). Boundary Matching for Realtime Sprouts. Advances in Computer Games 14
Édouard Bonnet, Florian Jamain, Abdallah Saffidine (2015). Draws, Zugzwangs, and PSPACE-Completeness in the Slither Connection Game. Advances in Computer Games 14
Matthias Beckmann (2015). On some Evacuation Games with Random Walks. Advances in Computer Games 14

Session 5

Taichi Ishitobi, Aske Plaat, Hiroyuki Iida, Jaap van den Herik (2015). Reducing the Seesaw Effect with Deep Proof Number Search. Advances in Computer Games 14
Jakub Pawlewicz, Ryan Hayward (2015). Feature Strength and Parallelization of Sibling Conspiracy Number Search. Advances in Computer Games 14

Session 6

Chu-Hsuan Hsueh, I-Chen Wu, Wen-Jie Tseng, Shi-Jim Yen, Jr-Chang Chen (2015). Strength Improvement and Analysis for an MCTS-Based Chinese Dark Chess Program. Advances in Computer Games 14
Yusaku Mandai, Tomoyuki Kaneko (2015). LinUCB Applied to Monte Carlo Tree Search. Advances in Computer Games 14
Yun-Ching Liu, Yoshimasa Tsuruoka (2015). Adapting Improved Upper Confidence Bounds for Monte-Carlo Tree Search. Advances in Computer Games 14

Day 3

Session 7

Yuichiro Sato, Hiroyuki Iida, Jaap van den Herik (2015). Transfer Learning by Inductive Logic Programming. Advances in Computer Games 14
Jos Uiterwijk (2015). Crystallisation of Domineering Snowflakes. Advances in Computer Games 14
Kei Takada, Masaya Honjo, Hiroyuki Iizuka, Masahito Yamamoto (2015). Developing Computer Hex using Global and Local Evaluation based on Board Network Characteristics. Advances in Computer Games 14

Session 8

Yoshiaki Yamaguchi, Todd W. Neller (2015). First Player’s Cannot-Lose Strategy in Cylinder-Infinite-Connect-Four for Widths 2 and 6. Advances in Computer Games 14
Kokolo Ikeda, Takanari Shishido, Simon Viennot (2015). Machine-Learning of Shape Names for the Game of Go. Advances in Computer Games 14

Session 9

Shu Yokoyama, Tomoyuki Kaneko, Tetsuro Tanaka (2015). Parameter-Free Tree Style Pipeline in Asynchronous Parallel Game-Tree Search. Advances in Computer Games 14
Nikolaos Papahristou, Ioannis Refanidis (2015). Constructing Pin Endgame Databases for the Backgammon Variant Plakoto. Advances in Computer Games 14

Photos

Day 1

Ingo Althöfer announcing Matej Guid on programming Progressive chess ^[5]

Day 3

Ryan Hayward announcing Yoshiaki Yamaguchi on Cylinder-Infinite-Connect-Four for Widths 2 and 6 ^[6]

Reports

Ingo Althöfer, Richard J. Lorentz, Matthias Beckmann (2015). Advances in Computer Games Conference 2015. Report, ICGA Journal, Vol. 38, No. 3

External Links

References

^ Snellius Building
^ Willebrord Snellius (1580 - 1626)
^ Photo Snellius Building by Gerd Isenberg, July 03, 2015
^ Progressive chess from Wikipedia
^ ICGA Events 2015: Photos Day 3 by Jan Krabbenbos
^ ICGA Events 2015: Photos Day 5 by Jan Krabbenbos

What links here?

Page	Date Edited
18th Computer Olympiad	Feb 5, 2018
Abdallah Saffidine	Aug 11, 2017
Advances in Computer Games 13	Jan 7, 2017
Advances in Computer Games 14	Aug 11, 2017
Advances in Computer Games 15	Aug 12, 2017
Aske Plaat	Jun 26, 2017
Backgammon	Dec 22, 2017
Cameron Browne	Dec 30, 2017
Chess	Jan 21, 2018
Chu-Hsuan Hsueh	Jul 19, 2017
Computer Olympiad	Mar 6, 2018
Conferences	Dec 18, 2017
Connect Four	Jan 31, 2018
Edouard Bonnet	Aug 13, 2017
Endgame Tablebases	Mar 6, 2018
Florian Jamain	Aug 11, 2017
Go	Jan 24, 2018
Guy Haworth	Nov 20, 2017
Hex	Dec 29, 2017
Hiroyuki Iida	Aug 11, 2017
I-Chen Wu	Sep 19, 2017
ICGA Journal	Dec 21, 2017
Ingo Althöfer	May 4, 2017
Ioannis Refanidis	Jan 19, 2016
Jaap van den Herik	Sep 18, 2017
Jakub Pawlewicz	Dec 29, 2017
Jos Uiterwijk	Aug 11, 2017
Jr-Chang Chen	Sep 18, 2017
Kei Takada	Jun 10, 2017
Kenneth Wingate Regan	Feb 19, 2018
Kokolo Ikeda	Mar 15, 2016
Learning	Feb 20, 2018
Leiden University	Jul 5, 2016
Marco Platzner	Dec 30, 2017
Match Statistics	Mar 31, 2018
Matej Guid	Jan 6, 2018
Monte-Carlo Tree Search	Apr 26, 2018
Nikolaos Papahristou	Jan 7, 2017
Olivier Teytaud	Jan 7, 2017
Parallel Search	Dec 30, 2017
Playing Strength	Mar 31, 2018
Proof-number search	Jan 22, 2018
Reinforcement Learning	Feb 12, 2018
Richard J. Lorentz	Aug 11, 2017
Ryan Hayward	Dec 29, 2017
Search	Feb 1, 2018
Shi-Jim Yen	Jul 22, 2017
Shogi	Feb 19, 2018
Shu Yokoyama	Oct 25, 2017
Simon Viennot	Aug 11, 2017
Stockfish	Apr 7, 2018
Taichi Ishitobi	Jan 23, 2016
Takanari Shishido	Jan 19, 2016
Tamal T. Biswas	Jun 19, 2017
Tetsuro Tanaka	Oct 25, 2017
Tobias Graf	Jul 8, 2016
Todd W. Neller	Aug 11, 2017
Tomoyuki Kaneko	Oct 25, 2017
Tristan Cazenave	Jan 22, 2018
UCT	Jan 22, 2018
Vito Janko	Jan 6, 2018
WCCC 2015	Jun 13, 2017
WCSC 2015	Jun 13, 2017
Wen-Jie Tseng	Sep 18, 2017
Yoshiaki Yamaguchi	Dec 18, 2016
Yoshimasa Tsuruoka	Aug 14, 2017

Up one Level

Advances in Computer Games 15

GerdIsenberg — Sat, 12 Aug 2017 08:40:33 GMT

Home * Conferences * Advances in Computer Games 15
< Prev Next >

		Advances in Computer Games 15, from July 3 to 5, 2017, Snellius Building ^[1] ^[2], Leiden University, Leiden, The Netherlands, in conjunction with the WCCC 2017, WCSC 2017, and the 20th Computer Olympiad. ACG is the conference of the ICGA.
Snellius Building ^[3]

Lectures

Day 1

Session 1

Richard J. Lorentz (2017). Machine Learning in the Game of Breakthrough. Advances in Computer Games 15
Katsuki Ohto, Tetsuro Tanaka (2017). A Curling Agent Based on the Monte-Carlo Tree Search Considering the Similarity of the Best Action among Similar States. Advances in Computer Games 15
Naoki Mizukami, Jun Suzuki, Hirotaka Kameko, Yoshimasa Tsuruoka (2017). Exploration Bonuses Based on Upper Confidence Bounds for Sparse Reward Games. Advances in Computer Games 15

Session 2

Noah Weninger, Ryan Hayward (2017). Exploring Positional Linear Go. Advances in Computer Games 15, pdf
Tristan Cazenave (2017). Improved Policy Networks for Computer Go. Advances in Computer Games 15, pdf
Danilo Carvalho, Minh Le Nguyen, Hiroyuki Iida (2017). An Analysis of Majority Voting in Homogeneous Groups for Checkers: Understanding Group Performance through Unbalance. Advances in Computer Games 15, ResearchGate

Day 2

Session 3

Cameron Browne (2017). Analysis of Fred Horn’s Gloop Puzzle. Advances in Computer Games 15, QUT ePrints
Jos Uiterwijk (2017). Set Matching: An Enhancement of the Hales-Jewett Pairing Strategy. Advances in Computer Games 15, arXiv:1703.10678
Michael Hartisch (2017). Yasol: An Open Source Solver for Quantified Mixed Integer Programs. Advances in Computer Games 15

Session 4

Édouard Bonnet (2017). Analytical Solution for "EinStein würfelt nicht!" with One Stone. Advances in Computer Games 15
Simon Viennot (2017). Toward Solving "EinStein würfelt nicht!". Advances in Computer Games 15
Todd W. Neller (2017). Optimal Play of the Farkle Dice Game. Advances in Computer Games 15

Day 3

Session 5

Jakub Kowalski, Jakub Sutowicz, Marek Szykuła (2017). Evaluating Chess-like Games Using Generated Natural Language Descriptions. Advances in Computer Games 15 ^[4]
Enkhbold Nyamsuren, Wim van der Vegt, Wim Westera (2017). Automated Adaptation and Assessment in Serious Games: a Portable Tool for Supporting Learning. Advances in Computer Games 15
Adam Boulton, Rachid Hourizi (2017). A Little Bit of Frustration Can Go a Long Way. Advances in Computer Games 15

Session 6

Kiminori Matsuzaki (2017). Developing 2048 Player with Backward Temporal Coherence Learning and Restart. Advances in Computer Games 15
Bruno Bouzy (2017). Playing Hanabi Near-Optimally. Advances in Computer Games 15
Matej Guid, Ivan Bratko (2017). Influence of Search Depth on Position Evaluation. Advances in Computer Games 15
Jiaxing Song (2017). Deep df-pn and its Efficient Implementations. Advances in Computer Games 15

Publications

The Board of the ICGA (2017). Five ICGA Events in Leiden, the Netherlands: July, 2017. ICGA Journal, Vol. 39, No. 1

External Links

Fifteenth International Conference on Advances in Computer Games 2017
ACG2017 — Program
2017 Events in Leiden by Jan Krabbenbos, ICGA, April 22, 2017

References

^ Snellius Building
^ Willebrord Snellius (1580 - 1626)
^ Photo Snellius Building by Gerd Isenberg, July 03, 2015
^ Jakub Kowalski, Jakub Sutowicz, Marek Szykuła (2017). Regular Boardgames. arXiv:1706.02462

What links here?

Page	Date Edited
20th Computer Olympiad	Feb 5, 2018
Advances in Computer Games 14	Aug 11, 2017
Advances in Computer Games 15	Aug 12, 2017
Breakthrough (Game)	Aug 11, 2017
Bruno Bouzy	Aug 12, 2017
Cameron Browne	Dec 30, 2017
Checkers	Dec 23, 2017
Computer Olympiad	Mar 6, 2018
Conferences	Dec 18, 2017
Deep Learning	Feb 12, 2018
Depth	Feb 25, 2018
Edouard Bonnet	Aug 13, 2017
EinStein würfelt nicht!	Aug 11, 2017
Games	Feb 20, 2018
Go	Jan 24, 2018
Hiroyuki Iida	Aug 11, 2017
Ivan Bratko	Aug 16, 2017
Jiaxing Song	Aug 12, 2017
Jos Uiterwijk	Aug 11, 2017
Katsuki Ohto	Aug 11, 2017
Matej Guid	Jan 6, 2018
Michael Hartisch	Aug 11, 2017
Monte-Carlo Tree Search	Apr 26, 2018
Naoki Mizukami	Aug 14, 2017
Noah Weninger	Aug 13, 2017
Proof-number search	Jan 22, 2018
Richard J. Lorentz	Aug 11, 2017
Ryan Hayward	Dec 29, 2017
Simon Viennot	Aug 11, 2017
Tetsuro Tanaka	Oct 25, 2017
Todd W. Neller	Aug 11, 2017
Tristan Cazenave	Jan 22, 2018
UCT	Jan 22, 2018
WCCC 2017	Dec 31, 2017
WCSC 2017	Jul 4, 2017
Yoshimasa Tsuruoka	Aug 14, 2017

Up one Level

Advances in Computer Games 9

GerdIsenberg — Tue, 15 Nov 2016 23:12:13 GMT

Home * Conferences * Advances in Computer Games 9
< Prev Next >

		The 9th Advances in Computer Chess Conference (ACC, changed to Advances in Computer Games ACG) took place at June 16 - 18, 1999, in Paderborn, Germany. All lectures will be given in the Heinz Nixdorf MuseumsForum (HNF), Fürstenallee 7, 33102 Paderborn. ACC is the conference of the ICCA. 14-15 accepted papers and 5 invited papers will appear in the series »Advances in Computer Chess« by University of Limburg, Maastricht. The proceedings will be edited by Jaap van den Herik and Burkhard Monien. They are expected to be published in January 2000.
Heinz Nixdorf MuseumsForum

Conference Proceedings

Conference Proceedings

Advances in Computer Games 9
Jaap van den Herik and Burkhard Monien (eds.) (2001)
Computer Science Department
IKAT, Universiteit Maastricht, Maastricht, The Netherlands. ISBN 90-6216-5761 / 90-6216-5664.

Lectures

Tony Marsland, Yngvi Björnsson (2001). Variable-Depth Search. Advances in Computer Games 9, pdf
Don Dailey, Charles E. Leiserson (2001). Using Cilk to Write Multiprocessor Chess Programs. Advances in Computer Games 9, pdf
Ernst A. Heinz (2001). Modeling the “Go Deep” Behaviour of CRAFTY and DARK THOUGHT. Advances in Computer Games 9
Marty Hirsch (2001). Machine Learning in MChess Professional. Advances in Computer Games 9
Eugene Nalimov, Guy Haworth, Ernst A. Heinz (2001). Space-efficient Indexing of Endgame Tables for Chess. Advances in Computer Games 9
Ernst A. Heinz (2001). Self-play Experiments in Computer Chess Revisited. Advances in Computer Games 9
Mikhail Donskoy (2001). How the Computer-Chess Methods Help to Build Better User Interfaces. Advances in Computer Games 9
Kevin Coplan (2001). Synthesis of Chess-like Endgames: Towards a Proof of Correctness. Advances in Computer Games 9
Ren Wu, Don Beal (2001). Computer Analysis of some Chinese Chess Endgames. Advances in Computer Games 9
Dennis Breuker, Jos Uiterwijk, Jaap van den Herik (2001). The PN2-Search Algorithm. Advances in Computer Games 9
Makoto Sakuta, Hiroyuki Iida (2001). The Performance of PN*, PDS, and PN Search on 6x6 Othello and Tsume-Shogi. Advances in Computer Games 9
Tsuyoshi Hashimoto, Yoichiro Kajihara, Nobusuke Sasaki, Hiroyuki Iida, Jin Yoshimura (2001). An Evaluation Function for Amazons. Advances in Computer Games 9
Yoshiyuki Kotani (2001). Example-based Piece Formation by Partial Matching in Shogi. Advances in Computer Games 9
Reijer Grimbergen (2001). Candidate Relevance Analysis for Selective Search in Shogi. Advances in Computer Games 9, pdf
Nobusuke Sasaki, M. Hirasawa, Tsuyoshi Hashimoto, Hiroyuki Iida, Jos Uiterwijk, Jaap van den Herik (2001). Hira, a Four-handed Shogi Program. Advances in Computer Games 9
Yngvi Björnsson, Tony Marsland (2001). Learning Search Control in Adversary Games. Advances in Computer Games 9, pdf
Michael Buro (2001). Efficient Approximation of Backgammon Race Equities. Advances in Computer Games 9, pdf
Tristan Cazenave (2001). Generating Patterns with External Conditions for the Game of Go. Advances in Computer Games 9, pdf
Jeng-Chi Yan, Shun-Chin Hsu (2001). A Positional Judgment System for computer Go. Advances in Computer Games 9
Helmut Pfleger, Frederic Friedel (2001). Cheating in Chess. Advances in Computer Games 9

Publications

Dap Hartmann (2001). Advances in Computer Games 9. ICGA Journal, Vol. 24, No. 4 (Review)

References

What links here?

Page	Date Edited
Advances in Computer Chess 8	Jun 26, 2017
Advances in Computer Games 10	Dec 30, 2016
Advances in Computer Games 9	Nov 15, 2016
Amazons	Aug 12, 2017
Automated Tuning	Feb 27, 2018
Backgammon	Dec 22, 2017
Book Learning	Jan 1, 2017
Burkhard Monien	Dec 19, 2016
Charles Leiserson	Oct 12, 2016
Cilk	Oct 28, 2013
Cilkchess	Jan 21, 2016
Conferences	Dec 18, 2017
Crafty	Jan 28, 2018
Dap Hartmann	Jun 10, 2017
DarkThought	Jul 3, 2018
Dennis Breuker	Dec 19, 2016
Depth	Feb 25, 2018
Don Beal	Jul 27, 2017
Don Dailey	Dec 7, 2016
Endgame	Sep 18, 2017
Endgame Tablebases	Mar 6, 2018
Ernst A. Heinz	Mar 6, 2017
Eugene Nalimov	Dec 23, 2016
Extensions	Apr 19, 2018
Frederic Friedel	Jan 6, 2018
Go	Jan 24, 2018
GUI	Mar 16, 2018
Guy Haworth	Nov 20, 2017
Heinz Nixdorf MuseumsForum	Sep 6, 2015
Hiroyuki Iida	Aug 11, 2017
ICGA Journal	Dec 21, 2017
Jaap van den Herik	Sep 18, 2017
Jeng-Chi Yan	Dec 28, 2016
Jin Yoshimura	Dec 22, 2016
Jos Uiterwijk	Aug 11, 2017
Kevin Coplan	Dec 17, 2016
Learning	Feb 20, 2018
Makoto Sakuta	Dec 22, 2016
Marty Hirsch	Dec 13, 2016
Match Statistics	Mar 31, 2018
MChess	Feb 26, 2018
Michael Buro	Dec 21, 2016
Mikhail Donskoy	Dec 23, 2017
Nalimov Tablebases	Dec 23, 2016
Nobusuke Sasaki	Jan 19, 2016
Opening Book	Feb 26, 2018
Othello	Jan 4, 2018
Playing Strength	Mar 31, 2018
Proof-number search	Jan 22, 2018
Reijer Grimbergen	Jan 4, 2017
Ren Wu	Jul 23, 2017
Shared Hash Table	Sep 11, 2017
Shogi	Feb 19, 2018
Shun-Chin Hsu	Jul 22, 2017
Singular Extensions	Jan 9, 2018
Tony Marsland	Nov 27, 2017
Tristan Cazenave	Jan 22, 2018
Tsuyoshi Hashimoto	Jan 3, 2017
User Interface	Feb 21, 2018
WCCC 1999	Jul 13, 2017
WMCCC 1999	Jan 7, 2016
Yngvi Björnsson	Jun 26, 2017
Yoichiro Kajihara	Dec 23, 2016
Yoshiyuki Kotani	Dec 27, 2016

Up one Level

CG 1998

GerdIsenberg — Thu, 28 May 2015 17:44:25 GMT

Proceedings

Lectures

Search and Strategies

Learning and Pattern Acquisition

Theory

Go, Tsume-Shogi, and Heian-Shogi

Home * Conferences * Computer and Games 1998
Next >

The First International Conference on Computers and Games was held in Tsukuba, Japan, November 11-12, 1998.

Proceedings

Jaap van den Herik and Hiroyuki Iida (eds.)
Computers and Games ^[1]
First International Conference, CG 1998
Tsukuba, Japan, November 11–12, 1998
Lecture Notes in Computer Science, Volume 1558, 1999
Springer Berlin
ISBN 3-540-65766-5

Lectures

Search and Strategies

Andreas Junghanns, Jonathan Schaeffer (1998). Relevance Cuts: Localizing the Search.. CG 1998
Yngvi Björnsson, Tony Marsland (1998). Multi-cut Pruning in Alpha-Beta Search. CG 1998
Dennis Breuker, Jaap van den Herik, Jos Uiterwijk, Victor Allis (1998). A Solution to the GHI Problem for Best-First Search. CG 1998
Ian Frank, David Basin (1998). Optimal Play against Best Defence: Complexity and Heuristics. CG 1998
Xinbo Gao, Hiroyuki Iida, Jos Uiterwijk, Jaap van den Herik (1998). A Speculative Strategy. CG 1998
Steven Willmott, Julian Richardson, Alan Bundy, John Levine (1998). An Adversarial Planning Approach to Go. CG 1998

Learning and Pattern Acquisition

Don Beal, Martin C. Smith (1998). First Results from Using Temporal Difference Learning in Shogi. CG 1998
Michael Buro (1998). From Simple Features to Sophisticated Evaluation Functions. CG 1998
Takuya Kojima, Atsushi Yoshikawa (1998). A Two-Step Model of Pattern Acquisition: Application to Tsume-Go. CG 1998
Nobusuke Sasaki, Yasuji Sawada, Jin Yoshimura (1998). A Neural Network Program of Tsume-Go. CG 1998
J. Ignacio Giráldez, Daniel Borrajo (1998). Distributed Decision Making in Checkers. CG 1998

Theory

Wim Pijls, Arie de Bruin (1998). Game Tree Algorithms and Solution Trees. CG 1998
Aviezri Fraenkel, Dmitri Zusman (1998). A New Heap Game. CG 1998
Aviezri Fraenkel, Ofer Rahat (1998). Infinite Cyclic Impartial Games. CG 1998
Marcel Crâşmaru (1998). On the Complexity of Tsume-Go. CG 1998
Bill Spight (1998). Extended Thermography for Multiple Kos in Go. CG 1998

Go, Tsume-Shogi, and Heian-Shogi

Martin Müller (1998). Computer Go: A Research Agenda. CG 1998
Morihiko Tajima, Noriaki Sanechika (1998). Estimating the Possible Omission Number for Groups in Go by the Number of n -th Dame. CG 1998
Atsushi Yoshikawa, Takuya Kojima, Yasuki Saito (1998). Relations between Skill and the Use of Terms. CG 1998
Reijer Grimbergen (1998). A Survey of Tsume-Shogi Programs Using Variable-Depth Search. CG 1998
Hiroyuki Iida, Jin Yoshimura, Kazuro Morita, Jos Uiterwijk (1998). Retrograde Analysis of the KGK Endgame in Shogi: Its Implications for Ancient Heian Shogi. CG 1998

Reports

Ian Frank, Reijer Grimbergen (1998). Report on the First International Conference on Computers and Games. ICCA Journal, Vol. 21, No. 4

External Links

1. CG 1998: Tsukuba, Japan from The DBLP Computer Science Bibliography

References

^ Computers and Games Books at sale at ICGA

What links here?

Page	Date Edited
Andreas Junghanns	Jun 26, 2017
Arie de Bruin	May 23, 2016
Automated Tuning	Feb 27, 2018
Aviezri Fraenkel	May 27, 2015
CG 1998	May 28, 2015
CG 2000	May 26, 2015
Checkers	Dec 23, 2017
Chessterfield	Sep 29, 2016
Conferences	Dec 18, 2017
Dennis Breuker	Dec 19, 2016
Don Beal	Jul 27, 2017
Evaluation	Feb 1, 2018
Games	Feb 20, 2018
Go	Jan 24, 2018
Graph History Interaction	Oct 16, 2017
Hiroyuki Iida	Aug 11, 2017
Ian Frank	Feb 7, 2017
ICGA Journal	Dec 21, 2017
Jaap van den Herik	Sep 18, 2017
Jin Yoshimura	Dec 22, 2016
Jonathan Schaeffer	Jan 29, 2018
Jos Uiterwijk	Aug 11, 2017
Learning	Feb 20, 2018
Martin C. Smith	May 23, 2016
Martin Müller	Aug 12, 2017
Matthias Lüscher	Sep 29, 2016
Michael Buro	Dec 21, 2016
Multi-Cut	Jul 4, 2016
Neural Networks	Mar 12, 2018
Nobusuke Sasaki	Jan 19, 2016
Opponent Model Search	Aug 14, 2017
Pruning	Jan 1, 2018
Reijer Grimbergen	Jan 4, 2017
Repetitions	Jan 16, 2018
Retrograde Analysis	Mar 21, 2017
Search	Feb 1, 2018
Search Tree	Dec 23, 2016
Shogi	Feb 19, 2018
Strategy	Jan 18, 2018
Temporal Difference Learning	Feb 20, 2018
The Turk	Apr 1, 2017
Tony Marsland	Nov 27, 2017
Victor Allis	Dec 19, 2016
Wim Pijls	May 23, 2016
Xinbo Gao	May 28, 2015
Yngvi Björnsson	Jun 26, 2017

Up one Level

CG 2000

GerdIsenberg — Tue, 26 May 2015 18:06:01 GMT

Proceedings

Lectures

Search and Strategies

Learning and Pattern Acquisition

Theory and Complexity Issues

Further Experiments with Games

Invited Talks and Reviews

Home * Conferences * Computer and Games 2000
< Prev Next >

The Second International Conference on Computers and Games was held in Hamamatsu, Japan, October 26-28, 2000.

Proceedings

		Tony Marsland and Ian Frank (eds.) Computers and Games ^[1] Second International Conference, CG 2000 Hamamatsu, Japan, October 26 - 28, 2000 Lecture Notes in Computer Science, Volume 2063, 2001 Springer ISBN 3-540-43080-6

Lectures

Search and Strategies

Paul E. Utgoff, Richard P. Cochran (2000). A Least-Certainty Heuristic for Selective Search. CG 2000 » LCF
Thomas Thomsen (2000). Lambda-Search in Game Trees - with Application to Go. CG 2000 also published in ICGA Journal, Vol. 23, No. 4, winning the 2001 ICGA Journal Award, preprint as pdf » Lambda-Search
Tristan Cazenave (2000). Abstract Proof Search. CG 2000, pdf
Makoto Sakuta, Hiroyuki Iida (2000). Solving Kriegspiel-Like Problems: Examining Efficient Search Methods. CG 2000
Thomas Lincke (2000). Strategies for the Automatic Construction of Opening Books. CG 2000 » Opening Book
Roel van der Goot (2000). Awari Retrograde Analysis.
Haw-ren Fang, Tsan-sheng Hsu, Shun-chin Hsu (2000). Construction of Chinese Chess Endgame Databases by Retrograde Analysis. CG 2000

Learning and Pattern Acquisition

Jack van Rijswijck (2000). Learning from Perfection: A Data Mining Approach to Evaluation Function Learning in Awari. CG 2000, pdf
Robert Levinson, Ryan Weber (2000). Chess Neighborhoods, Function Combination, and Reinforcement Learning. CG 2000, pdf
Jan Ramon, Tom Francis, Hendrik Blockeel (2000). Learning a Go Heuristic with Tilde. CG 2000
Levente Kocsis, Jos Uiterwijk, Jaap van den Herik (2000). Learning Time Allocation using Neural Networks. CG 2000, postscript

Theory and Complexity Issues

Wolfgang Slany (2000). The Complexity of Graph Ramsey Games. CG 2000
Aviezri Fraenkel (2000). Virus Versus Mankind. CG 2000
Richard J. Lorentz (2000). Creating Difficult Instances of the Post Correspondence Problem. CG 2000
Masashi Kiyomi, Tomomi Matsui (2000). Integer Programming Based Algorithms for Peg Solitaire Problems. CG 2000
Marcel Crâşmaru, John Tromp (2000). Ladders Are PSPACE-Complete. CG 2000
Michael Buro (2000). Simple Amazons Endgames and Their Connection to Hamilton Circuits in Cubic Subgrid Graphs. CG 2000, pdf

Further Experiments with Games

Ernst A. Heinz (2000). New Self-Play Results in Computer Chess. CG 2000
Jeff Rollason (2000). SUPER-SOMA - Solving Tactical Exchanges in Shogi without Tree Searching. CG 2000, Word preprint
Youhei Hori, Minenobu Seki, Tsutomu Maruyama, Reijer Grimbergen, Tsutomu Hoshino (2000). A Shogi Processor with a Field Programmable Gate Array. CG 2000
Reijer Grimbergen (2000). Plausible Move Generation Using Move Merit Analysis with Cut-Off Thresholds in Shogi. CG 2000
Jiefu Shi, Michael L. Littman (2000). Abstraction Methods for Game Theoretic Poker. CG 2000
Takahisa Ando, Takao Uehara (2000). Reasoning by Agents in Computer Bridge Bidding. CG 2000

Invited Talks and Reviews

Boris Stilman (2000). Linguistic Geometry for Solving War Games. CG 2000
Kei-ichi Tainaka (2000). Physics and Ecology of Rock-Paper-Scissors Game. CG 2000
Michael L. Littman (2000). Review: Computer Language Games. CG 2000
Martin Müller (2000). Review: Computer Go 1984–2000. CG 2000
Alexander Nareyek (2000). Review: Intelligent Agents for Computer Games. CG 2000
Itsuki Noda, Ian Frank (2000). Review: RoboCup through 2000. CG 2000
Takenobu Takizawa, Reijer Grimbergen (2000). Review: Computer Shogi through 2000. CG 2000

Reports & Reviews

Jack van Rijswijck, Martin Müller (2001). The Second International Conference on Computers and Games. ICCA Journal, Vol. 24, No. 1
Dap Hartmann (2002). Computers and Games. ICGA Journal, Vol. 25, No. 2 (Review)

External Links

2. CG 2000: Hamamatsu, Japan from The DBLP Computer Science Bibliography

References

^ Computers and Games Books at sale at ICGA

What links here?

Page	Date Edited
Amazons	Aug 12, 2017
Automated Tuning	Feb 27, 2018
Aviezri Fraenkel	May 27, 2015
Awari	Feb 14, 2017
Best-First	Dec 29, 2017
Boris Stilman	Apr 30, 2015
CG 1998	May 28, 2015
CG 2000	May 26, 2015
CG 2002	Jun 9, 2015
Chinese Chess	Jan 16, 2018
Conferences	Dec 18, 2017
Connectivity	Mar 6, 2016
Dap Hartmann	Jun 10, 2017
Depth	Feb 25, 2018
Endgame Tablebases	Mar 6, 2018
Ernst A. Heinz	Mar 6, 2017
FPGA	Jul 9, 2016
Games	Feb 20, 2018
Go	Jan 24, 2018
Haw-ren Fang	Jun 22, 2015
Ian Frank	Feb 7, 2017
ICGA Journal	Dec 21, 2017
Jaap van den Herik	Sep 18, 2017
Jack van Rijswijck	Dec 22, 2016
Jeff Rollason	Dec 23, 2016
John Tromp	Jan 6, 2017
Jos Uiterwijk	Aug 11, 2017
KriegSpiel	Sep 5, 2017
Learning	Feb 20, 2018
Levente Kocsis	Dec 23, 2016
Makoto Sakuta	Dec 22, 2016
Martin Müller	Aug 12, 2017
Match Statistics	Mar 31, 2018
Merlin (GB)	Mar 25, 2015
Michael Buro	Dec 21, 2016
Michael L. Littman	Feb 11, 2018
Morph	Dec 7, 2017
Neural Networks	Mar 12, 2018
Opening Book	Feb 26, 2018
Paul E. Utgoff	Dec 20, 2016
Playing Strength	Mar 31, 2018
Proof-number search	Jan 22, 2018
Quiescence Search	Aug 19, 2017
Reijer Grimbergen	Jan 4, 2017
Reinforcement Learning	Feb 12, 2018
Retrograde Analysis	Mar 21, 2017
Richard J. Lorentz	Aug 11, 2017
Richard P. Cochran	Mar 28, 2015
Robert Levinson	Aug 25, 2016
Ryan Weber	Sep 25, 2015
Search	Feb 1, 2018
Selectivity	Jan 12, 2018
Shogi	Feb 19, 2018
Shun-Chin Hsu	Jul 22, 2017
SOMA	Mar 25, 2015
Static Exchange Evaluation	Dec 14, 2017
Temporal Difference Learning	Feb 20, 2018
Thomas Lincke	Dec 22, 2016
Thomas Thomsen	Mar 25, 2015
Time Management	Mar 20, 2018
Tony Marsland	Nov 27, 2017
Treebeard	Mar 25, 2015
Tristan Cazenave	Jan 22, 2018
Tsan-sheng Hsu	Jul 17, 2017

Up one Level

CG 2002

GerdIsenberg — Tue, 09 Jun 2015 09:31:13 GMT

Proceedings

Lectures

Evaluation and Learning

Combinatorial Games/Theory

Opening/Endgame Databases

Commercial Games

Single-Agent Search/Planning

Home * Conferences * Computer and Games 2002
< Prev Next >

The Third International Conference on Computers and Games was held in Edmonton, Canada, July 25-27, 2002.

Proceedings

		Jonathan Schaeffer, Martin Müller, Yngvi Björnsson (eds.) Computers and Games ^[1] Third International Conference, CG 2002 Edmonton, Canada, July 25 - 27, 2002 Lecture Notes in Computer Science, Volume 2883, 2003 Springer Berlin / Heidelberg ISBN 978-3-540-20545-6

Lectures

^[2]

Evaluation and Learning

David Wolfe (2002). Distinguishing Gamblers from Investors at the Blackjack Table. CG 2002
Konstantinos Tournavitis (2002). MOUSE(μ): A Self-teaching Algorithm that Achieved Master-Strength at Othello. CG 2002
Graham Kendall, Stephen Shaw (2002). Investigation of an Adaptive Cribbage Player. CG 2002
Ari Shapiro, Gil Fuchs, Robert Levinson (2002). Learning a Game Strategy Using Pattern-Weights and Self-play. CG 2002

Search

Mark Winands, Jos Uiterwijk, Jaap van den Herik (2002). PDS-PN: A New Proof-Number Search Algorithm: Application to Lines of Action. CG 2002
Tristan Cazenave (2002). A Generalized Threats Search Algorithm. CG 2002
Martin Müller (2002). Proof-Set Search. CG 2002
Nathan Sturtevant (2002). A Comparison of Algorithms for Multi-player Games. CG 2002
Henry Avetisyan, Richard J. Lorentz (2002). Selective Search in an Amazons Program. CG 2002
Ingo Althöfer, Raymond Georg Snatzke (2002). Playing Games with Multiple Choice Systems. CG 2002
Levente Kocsis, Jos Uiterwijk, Eric Postma, Jaap van den Herik (2002). The Neural MoveMap Heuristic in Chess. CG 2002
Reijer Grimbergen, Jeff Rollason (2002). Board Maps and Hill-Climbing for Opening and Middle Game Play in Shogi. CG 2002

Combinatorial Games/Theory

Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer (2002). Solitaire Clobber. CG 2002
Aviezri Fraenkel, Ofer Rahat (2002). Complexity of Error-Correcting Codes Derived from Combinatorial Games. CG 2002
Teigo Nakamura, Elwyn Berlekamp (2002). Analysis of Composite Corridors. CG 2002

Opening/Endgame Databases

Jing Yang, Simon Liao, Mirek Pawlak (2002). New Winning and Losing Positions for 7×7 Hex. CG 2002
Thomas Lincke (2002). Position-Value Representation in Opening Books. CG 2002
Haw-ren Fang, Tsan-sheng Hsu, Shun-Chin Hsu (2002). Indefinite Sequence of Moves in Chinese Chess Endgames. CG 2002

Commercial Games

Michael Buro (2002). ORTS: A Hack-Free RTS Game Environment. CG 2002
Craig A. Lindley, Mirjam Eladhari (2002). Causal Normalization: A Methodology for Coherent Story Logic Design in Computer Role-Playing Games. CG 2002
Clark Verbrugge (2002). A Structure for Modern Computer Narratives. CG 2002

Single-Agent Search/Planning

Ling Zhao (2002). Tackling Post’s Correspondence Problem. CG 2002
Carlos Linares López, Andreas Junghanns (2002). Perimeter Search Performance. CG 2002
Adi Botea, Martin Müller, Jonathan Schaeffer (2002). Using Abstraction for Planning in Sokoban. CG 2002

Computer Go

Bruno Bouzy (2002). A Small Go Board Study of Metric and Dimensional Evaluation Functions. CG 2002
Erik van der Werf, Jos Uiterwijk, Eric Postma, Jaap van den Herik (2002). Local Move Prediction in Go. CG 2002
Bill Spight (2002). Evaluating Kos in a Neutral Threat Environment: Preliminary Results. CG 2002

External Links

3. CG 2002: Edmonton, Canada from The DBLP Computer Science Bibliography
CG'02 Special Announcements, Elwyn Berlekamp's Clobber problem composition contest

References

What links here?

Page	Date Edited
7th Computer Olympiad	Jul 23, 2017
Adi Botea	Jan 22, 2018
Amazons	Aug 12, 2017
Andreas Junghanns	Jun 26, 2017
Ari Shapiro	Sep 22, 2015
Aviezri Fraenkel	May 27, 2015
CG 2000	May 26, 2015
CG 2002	Jun 9, 2015
CG 2004	Dec 29, 2016
Chessmaps Heuristic	Aug 27, 2015
Chinese Chess	Jan 16, 2018
Clobber	May 16, 2017
Conferences	Dec 18, 2017
Crafty	Jan 28, 2018
David Wolfe	Jun 25, 2015
Elwyn Berlekamp	Jun 25, 2015
Eric Postma	May 26, 2015
Erik van der Werf	Dec 31, 2016
Games	Feb 20, 2018
Gil Fuchs	Sep 22, 2015
Go	Jan 24, 2018
Graham Kendall	May 26, 2015
Haw-ren Fang	Jun 22, 2015
Hex	Dec 29, 2017
Ingo Althöfer	May 4, 2017
Jaap van den Herik	Sep 18, 2017
Jeff Rollason	Dec 23, 2016
Jing Yang	May 23, 2016
Jonathan Schaeffer	Jan 29, 2018
Jos Uiterwijk	Aug 11, 2017
Learning	Feb 20, 2018
Levente Kocsis	Dec 23, 2016
Lines of Action	Feb 5, 2018
Ling Zhao	Jun 24, 2015
Mark Winands	Sep 19, 2017
Martin Müller	Aug 12, 2017
Michael Buro	Dec 21, 2016
Mirek Pawlak	May 23, 2016
Move Ordering	Feb 27, 2018
Nathan Sturtevant	Oct 23, 2015
Neural MoveMap Heuristic	Sep 24, 2015
Neural Networks	Mar 12, 2018
Octavius	Dec 7, 2017
Opening Book	Feb 26, 2018
Othello	Jan 4, 2018
Pattern Recognition	Sep 8, 2017
Planning	Feb 12, 2018
Proof-number search	Jan 22, 2018
Raymond Georg Snatzke	May 26, 2015
Reijer Grimbergen	Jan 4, 2017
Richard J. Lorentz	Aug 11, 2017
Robert Levinson	Aug 25, 2016
Search	Feb 1, 2018
Shogi	Feb 19, 2018
Shun-Chin Hsu	Jul 22, 2017
Simon Liao	Apr 28, 2011
Simulated Annealing	May 8, 2017
Temporal Difference Learning	Feb 20, 2018
Thomas Lincke	Dec 22, 2016
Tristan Cazenave	Jan 22, 2018
Tsan-sheng Hsu	Jul 17, 2017

Up one Level

CG 2004

GerdIsenberg — Thu, 29 Dec 2016 10:32:24 GMT

Home * Conferences * Computer and Games 2004
< Prev Next >

		The Fourth International Conference on Computers and Games was held at the Gonda Brain Research Center of the Bar-Ilan University in Ramat Gan, Israel, July 5-7, 2004, in conjunction with the 9th Computer Olympiad and the 12th World Computer Chess Championship .
Gonda Brain Research Center ^[1]

Proceedings

		Jaap van den Herik, Yngvi Björnsson, Nathan S. Netanyahu (eds.) Computers and Games ^[2] 4th International Conference, CG 2004 Ramat Gan, Israel, July 5-7, 2004 Lecture Notes in Computer Science, Volume 3846, 2006 Springer Berlin / Heidelberg ISBN 3-540-32488-7

Lectures

^[3]

Brian Sheppard (2004). Efficient Control of Selective Simulations. CG 2004
Darse Billings, Aaron Davidson, Terence Schauenberg, Neil Burch, Michael Bowling, Robert Holte, Jonathan Schaeffer, Duane Szafron (2004). Game-Tree Search with Adaptation in Stochastic Imperfect-Information Games. CG 2004
Thomas Hauk, Michael Buro, Jonathan Schaeffer (2004). Rediscovering *-Minimax Search. CG 2004, pdf
Thomas Hauk, Michael Buro, Jonathan Schaeffer (2004). *-Minimax Performance in Backgammon. CG 2004
Bruno Bouzy (2004). Associating Shallow and Selective Global Tree Search with Monte Carlo for 9 × 9 Go. CG 2004
Erik van der Werf, Jaap van den Herik, Jos Uiterwijk (2004). Learning to Estimate Potential Territory in the Game of Go. CG 2004, pdf
Xiaozhen Niu, Martin Müller (2004). An Improved Safety Solver for Computer Go. CG 2004
Jan Ramon, Tom Croonenborghs (2004). Searching for Compound Goals Using Relevancy Zones in the Game of Go. CG 2004
Haw-ren Fang (2004). Rule-Tolerant Verification Algorithms for Completeness of Chinese-Chess Endgame Databases. CG 2004
Ping-hsun Wu, Ping-Yi Liu, Tsan-sheng Hsu (2004). An External-Memory Retrograde Analysis Algorithm. CG 2004
Akop Karapetyan, Richard J. Lorentz (2004). Generating an Opening Book for Amazons. CG 2004
David Fotland (2004). Building a World-Champion Arimaa Program. CG 2004
Omid David, Ariel Felner, Nathan S. Netanyahu (2004). Blockage Detection in Pawn Endings. CG 2004, pdf
Jeroen Donkers, Jaap van den Herik, Jos Uiterwijk (2004). Dao: A Benchmark Game. CG 2004
Bernard Helmstetter, Tristan Cazenave (2004). Incremental Transpositions. CG 2004, pdf
Rudolf Fleischer, Gerhard Trippen (2004). Kayles on the Way to the Stars. CG 2004 ^[4]
Andrea Bolognesi, Paolo Ciancarini (2004). Searching over Metapositions in Kriegspiel. CG 2004
Mark Winands, Erik van der Werf, Jaap van den Herik, Jos Uiterwijk (2004). The Relative History Heuristic. CG 2004, pdf
Martin Müller, Zhichao Li (2004). Locally Informed Global Search for Sums of Combinatorial Games. CG 2004
Nathan Sturtevant (2004). Current Challenges in Multi-player Game Search. CG 2004
Jouni Smed, Harri Hakonen (2004). Preventing Look-Ahead Cheating with Active Objects. CG 2004
Joshua Estelle (et al.) (2004). Strategic Interactions in the TAC 2003 Supply Chain Tournament. CG 2004

Photos



The conference hall, where also the players meeting of the WCCC and Olympiad took place ^[5]

Jonathan Schaeffer's lecture on *-Minimax Search ^[6]

Reports

Bruno Bouzy (2004). The 4th Computers and Games conference. ICGA Journal, Vol. 27, No. 3

External Links

References

What links here?

Page	Date Edited
9th Computer Olympiad	Jul 22, 2017
Amazons	Aug 12, 2017
Ariel Felner	Feb 15, 2017
Arimaa	Jan 4, 2017
Backgammon	Dec 22, 2017
Bar-Ilan University	Feb 15, 2017
Bernard Helmstetter	May 23, 2016
Blockage Detection	Oct 19, 2017
Brian Sheppard	Feb 6, 2017
Bruno Bouzy	Aug 12, 2017
CG 2002	Jun 9, 2015
CG 2004	Dec 29, 2016
CG 2006	Dec 28, 2016
Chinese Chess	Jan 16, 2018
Chiron	Sep 24, 2017
Computer Olympiad	Mar 6, 2018
Conferences	Dec 18, 2017
Darse Billings	Feb 14, 2017
David Fotland	Jan 6, 2017
Duane Szafron	Feb 20, 2018
Endgame Tablebases	Mar 6, 2018
Erik van der Werf	Dec 31, 2016
Gerhard Trippen	Jun 8, 2015
Go	Jan 24, 2018
Haw-ren Fang	Jun 22, 2015
ICGA Journal	Dec 21, 2017
Jaap van den Herik	Sep 18, 2017
Jeroen Donkers	Dec 23, 2016
Jonathan Schaeffer	Jan 29, 2018
Jos Uiterwijk	Aug 11, 2017
KriegSpiel	Sep 5, 2017
Mark Winands	Sep 19, 2017
Martin Müller	Aug 12, 2017
Michael Bowling	Feb 20, 2018
Michael Buro	Dec 21, 2016
Minimax	Dec 29, 2017
Monte-Carlo Tree Search	Apr 26, 2018
Move Ordering	Feb 27, 2018
Nathan S. Netanyahu	Dec 26, 2016
Nathan Sturtevant	Oct 23, 2015
Neil Burch	Jan 10, 2018
Omid David	Jan 2, 2017
Paolo Ciancarini	Dec 28, 2016
Ping-hsun Wu	Jun 8, 2015
Relative History Heuristic	Jun 8, 2015
Retrograde Analysis	Mar 21, 2017
Richard J. Lorentz	Aug 11, 2017
Robert Holte	Feb 15, 2017
Transposition	Jun 8, 2015
Tristan Cazenave	Jan 22, 2018
Tsan-sheng Hsu	Jul 17, 2017
WCCC 2004	Jan 28, 2018
Yngvi Björnsson	Jun 26, 2017

Up one Level

CG 2006

GerdIsenberg — Wed, 28 Dec 2016 15:15:50 GMT

Home * Conferences * Computer and Games 2006
< Prev Next >

		The Fifth International Conference on Computers and Games was held in the Aula Magna, the Conference Hall of the University of Turin, Turin, Italy, May 29-31, 2006, in conjunction with the 11th Computer Olympiad , the 14th World Computer Chess Championship, and the human FIDE 37th Chess Olympiad.
University of Turin ^[1]

Proceedings

		Jaap van den Herik, Paolo Ciancarini, Jeroen Donkers (eds.) Computers and Games ^[2] 5th International Conference, CG 2006 Turin, Italy, May 29-31, 2006 Lecture Notes in Computer Science, Volume 4630, 2007 Springer Berlin / Heidelberg ISBN 978-3-540-75537-1

Lectures

^[3]

Matej Guid, Ivan Bratko (2006). Computer Analysis of Chess Champions. CG 2006
Aleksander Sadikov, Martin Možina, Matej Guid, Jana Krivec, Ivan Bratko (2006). Automated Chess Tutor. CG 2006
Ken Chen, Peigang Zhang (2006). A New Heuristic Search Algorithm for Capturing Problems in Go. CG 2006
Xiaozhen Niu, Martin Müller (2006). An Open Boundary Safety-of-Territory Solver for the Game of Go. CG 2006
Jahn-Takeshi Saito, Guillaume Chaslot, Jos Uiterwijk, Jaap van den Herik (2006). Monte-Carlo Proof-Number Search for Computer Go. CG 2006
Tristan Cazenave (2006). Virtual Global Search: Application to 9×9 Go. CG 2006
Rémi Coulom (2006). Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search. CG 2006
John Tromp, Gunnar Farnebäck (2006). Combinatorics of Go. CG 2006
Bo-Nian Chen, Pangfeng Liu, Shun-Chin Hsu, Tsan-sheng Hsu (2006). Abstracting Knowledge from Annotated Chinese-Chess Game Records. CG 2006
Ryan Hayward, Broderick Arneson, Philip Henderson (2006). Automatic Strategy Verification for Hex. CG 2006, pdf
Nathan Sturtevant, Adam White (2006). Feature Construction for Reinforcement Learning in Hearts. CG 2006, pdf, slides as pdf ^[4]
Sebastian Kupferschmid, Malte Helmert (2006). A Skat Player Based on Monte-Carlo Simulation. CG 2006 ^[5]
James Glenn, Haw-ren Fang, Clyde Kruskal (2006). A Retrograde Approximation Algorithm for One-Player Can’t Stop. CG 2006, pdf ^[6]
Jakub Pawlewicz, Łukasz Lew (2006). Improving Depth-First PN-Search: 1 + ε Trick. CG 2006, pdf
Aleksander Sadikov, Ivan Bratko (2006). Search Versus Knowledge Revisited Again. CG 2006
Alessandro Cincotti (2006). Counting the Number of Three-Player Partizan Cold Games. CG 2006
Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman (2006). LUMINES Strategies. CG 2006 ^[7]
Peter Bro Miltersen, Troels Bjerre Sørensen (2006). Computing Proper Equilibria of Zero-Sum Games. CG 2006
Cherif R. S. Andraos, Manal M. Zaky, Salma A. Ghoneim (2006). Comparative Study of Approximate Strategies for Playing Sum Games Based on Subgame Types. CG 2006
Sébastien Collette, Jean-François Raskin, Frédéric Servais (2006). On the Symbolic Computation of the Hardest Configurations of the RUSH HOUR Game. CG 2006
Shunsaku Kato, Shuichi Miyazaki, Yusuke Nishimura, Yasuo Okabe (2006). Cheat-Proof Serverless Network Games. CG 2006
Will Leckie, Michael Greenspan (2006). Monte-Carlo Methods in Pool Strategy Game Trees. CG 2006
Jean-Pierre Dussault, Jean-François Landry (2006). Optimization of a Billiard Player – Tactical Play. CG 2006
Lizette de Wet, Theo McDonald (2006). Gender and Cultural Differences (If Any!): South African School Children and Computer Games. CG 2006

Photos



Smalltalk during a break between lectures ^[8]

Ryan Hayward, Philip Henderson, Broderick Arneson, and Morgan Kan verifying Hex Strategies ^[9]

Reports

Matej Guid (2006). The 5th Computer and Games Conference. ICGA Journal, Vol. 29, No. 2

External Links

6. CG 2006: Turin, Italy

References

^ Rectorate Palace of the University of Turin, image by Unitomaster, March 08, 2007, CC BY-SA 3.0, Wikimedia Commons, University of Turin from Wikipedia
^ Computers and Games, Books at sale at ICGA
^ Computers and Games - Springer
^ Hearts from Wikipedia
^ Skat (card game) from Wikipedia
^ Can't Stop (board game) from Wikipedia
^ Lumines from Wikipedia
^ Computer Olympiad in Torino, Italy, Photo gallery by Hiroshi Yamashita
^ Ryan Hayward (2006). Six Wins Hex Tournament, ICGA Journal, Vol. 29, No 3, pdf

What links here?

Page	Date Edited
11th Computer Olympiad	Jul 22, 2017
Aleksander Sadikov	Jan 2, 2017
Alessandro Cincotti	Jan 23, 2016
Bo-Nian Chen	Jul 17, 2017
Broderick Arneson	Jan 8, 2017
Butterfly Heuristic	May 6, 2016
CG 2004	Dec 29, 2016
CG 2006	Dec 28, 2016
CG 2008	Jan 3, 2017
Chinese Chess	Jan 16, 2018
Clyde Kruskal	Jan 2, 2017
Computer Olympiad	Mar 6, 2018
Conferences	Dec 18, 2017
Dap Hartmann	Jun 10, 2017
Games	Feb 20, 2018
Go	Jan 24, 2018
Guillaume Chaslot	Jan 2, 2017
Gunnar Farnebäck	Jan 23, 2017
Haw-ren Fang	Jun 22, 2015
Hex	Dec 29, 2017
Ivan Bratko	Aug 16, 2017
Jaap van den Herik	Sep 18, 2017
Jahn-Takeshi Saito	Jan 2, 2017
Jakub Pawlewicz	Dec 29, 2017
James Glenn	Jun 22, 2015
Jana Krivec	Jul 15, 2017
Jeroen Donkers	Dec 23, 2016
John Tromp	Jan 6, 2017
Jos Uiterwijk	Aug 11, 2017
Keh-Hsun Chen	Jan 16, 2017
Knowledge	Jul 22, 2017
Martin Možina	Jun 11, 2016
Martin Müller	Aug 12, 2017
Matej Guid	Jan 6, 2018
Michael Greenspan	Dec 29, 2016
Monte-Carlo Tree Search	Apr 26, 2018
Nathan Sturtevant	Oct 23, 2015
Pangfeng Liu	Feb 24, 2016
Paolo Ciancarini	Dec 28, 2016
Peigang Zhang	Jan 2, 2017
Philip Henderson	Jan 6, 2017
Playing Strength	Mar 31, 2018
Proof-number search	Jan 22, 2018
Rémi Coulom	Feb 5, 2018
Retrograde Analysis	Mar 21, 2017
Ryan Hayward	Dec 29, 2017
Shaun Press	Sep 24, 2014
Shun-Chin Hsu	Jul 22, 2017
Tristan Cazenave	Jan 22, 2018
Tsan-sheng Hsu	Jul 17, 2017
WCCC 2006	Jan 28, 2018
Will Leckie	Dec 28, 2016
Xinhe Xu	Jan 3, 2017
Łukasz Lew	Jun 9, 2015

Up one Level

Wikispaces : chessprogramming - items matching description

Advances in Computer Chess 1

Table of Contents

Proceedings

Lectures

Reviews

The Forerunner

ACC1

Forum Posts

External Links

References

What links here?

Advances in Computer Chess 2

Table of Contents

Proceedings

Lectures

Announcement

Reviews

External Links

References

What links here?

Advances in Computer Chess 3

Table of Contents

Proceedings

Lectures

Reports

External Links

References

What links here?

Advances in Computer Chess 4

Table of Contents

Proceedings

Lectures

Photos

Challenge Match

See also

Reports

Reviews

Forum Posts

References

What links here?

Advances in Computer Chess 5

Table of Contents

Proceedings

Synopsis

Mephisto Best-Publication Award

Photos

During

Between

Lectures

Reports

External Links

References

What links here?

Advances in Computer Chess 6

Table of Contents

Proceedings

Synopsis

Lectures

See also

Reports

References

What links here?

Advances in Computer Chess 7

Table of Contents

Proceedings

Lectures

Forum Posts

Reports

References

What links here?

Advances in Computer Chess 8

Table of Contents

Conference Proceedings

Lectures

Exhibition Games

Reports

Forum Posts

External Links

References