Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=252
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A new heap game
Aviezri S. Fraenkel
,
Dmitri Zusman
Theoretical Computer Science
252
(1-2), 2001, pp. 5-12
Infinite cyclic impartial games
Aviezri S. Fraenkel
,
Ofer Rahat
Theoretical Computer Science
252
(1-2), 2001, pp. 13-22
Extended thermography for multiple kos in go
William L. Spight
Theoretical Computer Science
252
(1-2), 2001, pp. 23-43
Applying adversarial planning techniques to Go
Steven Willmott
,
Julian Richardson
,
Alan Bundy
,
John Levine
Theoretical Computer Science
252
(1-2), 2001, pp. 45-82
Strategies anticipating a difference in search depth using opponent-model search
Xinbo Gao
,
Hiroyuki Iida
,
Jos W.H.M. Uiterwijk
,
H. Jaap van den Herik
Theoretical Computer Science
252
(1-2), 2001, pp. 83-104
Temporal difference learning applied to game playing and the results of application to shogi
Donald F. Beal
,
Martin C. Smith
Theoretical Computer Science
252
(1-2), 2001, pp. 105-119
A soluton to the GHI problem for best-first search
Dennis M. Breuker
,
H. Jaap van den Herik
,
Jos W.H.M. Uiterwijk
,
L. Victor Allis
Theoretical Computer Science
252
(1-2), 2001, pp. 121-149
Sokoban: Improving the search with relevance cuts
Andreas Junghanns
,
Jonathan Schaeffer
Theoretical Computer Science
252
(1-2), 2001, pp. 151-175
Multi-cut
\alpha\beta
-pruning in game-tree search
Yngvi Björnsson
,
Tony A. Marsland
Theoretical Computer Science
252
(1-2), 2001, pp. 177-196
Game tree algorithms and solution trees
Wim Pijls
,
Arie de Bruin
Theoretical Computer Science
252
(1-2), 2001, pp. 197-215
A theoretical and empirical investigation of search in imperfect information games
Ian Frank
,
David Basin
Theoretical Computer Science
252
(1-2), 2001, pp. 217-256