[PDF][PDF] Search versus knowledge in game-playing programs revisited

A Junghanns, J Schaeffer - IJCAI (1), 1997 - Citeseer
Perfect knowledge about a domain renders search unnecessary and, likewise, exhaustive
search obviates heuristic knowledge. In practise, a tradeoff is found somewhere in the …

[PDF][PDF] The Future of Chess-Playing Technologies and the Significance of Kasparov versus Deep Blue.

D DeCoste - Deep blue versus Kasparov: the significance for …, 1997 - cdn.aaai.org
In this paper we argue that the recent Garry Kasparov vs. Deep Blue matches are significant
for the field of artificial intelligence in several ways, including providing an example of …

[PDF][PDF] The Historical Development of Computer Chess and its Impact on Artificial Intelligence.

D Heath, D Allum, P Square - Deep Blue Versus Kasparov: The …, 1997 - cdn.aaai.org
In this paper we review the historical development of computer chess and discuss its impact
on the concept of intelligence. With the advent of electronic computers after the Second …

[PDF][PDF] Knightcap: A chess program that learns by combining TD () with minimax search

J Baxter, A Tridgell, L Weaver - Proceeding 15th International …, 1997 - hemptrek.com
In this paper we present TDLeaf (£), a variation on the TD (£) algorithm that enables it to be
used in conjunction with minimax search. We present some experiments in which our chess …

A theory of game trees, based on solution trees

W Pijls, A de Bruin - SOFSEM'97: Theory and Practice of Informatics: 24th …, 1997 - Springer
In this paper, a theory of game tree algorithms is presented, entirely based upon the concept
of solution tree. During execution of a game tree algorithm, one may distinguish between so …

[PDF][PDF] Intelligent Adversary Searches

P Pantel - Artificial Intelligence, 1997 - Citeseer
1. Introduction ames have always been a passion of humans. They have historically been
perceived as intellectual hobbies. So, it is only natural to view the automation of intelligent …