Zobrazeno 1 - 10
of 58
pro vyhledávání: '"Tony Marsland"'
Autor:
Tony Marsland
Publikováno v:
ICGA Journal. 42:90-98
This article is based on my personal reminiscences about the early days of computer chess tournaments, describing not only how different the technology was, but also that progress was steady and continues today in the broader field of Artificial Inte
Autor:
Yngvi Björnsson, Tony Marsland
Publikováno v:
Information Sciences. 154:95-118
The strength of a program for playing an adversary game like chess or checkers is greatly influenced by how selectively it explores the various branches of the game tree. Typically, some branch paths are discontinued early while others are explored m
Autor:
Yngvi Björnsson, Tony Marsland
Publikováno v:
Theoretical Computer Science. 252:177-196
The efficiency of the αβ-algorithm as a minimax search procedure can be attributed to its effective pruning at the so-called cut-nodes; ideally only one move is examined there to establish the minimax value. This paper explores the benefits of inve
Autor:
Tony Marsland, Yngvi Björnsson
Publikováno v:
Information Sciences. 122:23-41
In the half century since minimax was first suggested as a strategy for adversary game search, various search algorithms have been developed. The standard approach has been to use improvements to the Alpha–Beta ( α – β ) algorithm. Some of the
Publikováno v:
ICGA Journal. 20:29-37
Autor:
Tony Marsland
Publikováno v:
ICGA Journal. 19:263-267
Autor:
Alexander Reinefeld, Tony Marsland
Publikováno v:
IEEE Transactions on Pattern Analysis and Machine Intelligence. 16:701-710
Iterative-deepening searches mimic a breadth-first node expansion with a series of depth-first searches that operate with successively extended search horizons. They have been proposed as a simple way to reduce the space complexity of best-first sear
Autor:
Fred Popowich, Tony Marsland
Publikováno v:
IEEE transactions on pattern analysis and machine intelligence. 7(4)
The design issues affecting a parallel implementation of the alpha-beta search algorithm are discussed with emphasis on a tree decomposition scheme that is intended for use on well ordered trees. In particular, the principal variation splitting metho
Publikováno v:
Concurrency: Practice and Experience. 3:203-219
Although both shared memory and loosely coupled parallel computing systems are now common, many still do not offer an easy way to design, implement, and test parallel algorithms. Our system provides software tools that make possible a variety of conn
Autor:
Tony Marsland
Publikováno v:
ICGA Journal. 22:147-149