dblp.uni-trier.dewww.uni-trier.de

Yngvi Björnsson

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2008
21 Hilmar Finnsson, Yngvi Björnsson: Simulation-Based Approach to General Game Playing. AAAI 2008: 259-264
20EEJónheiður Ísleifsdóttir, Yngvi Björnsson: GTQ: A Language and Tool for Game-Tree Analysis. Computers and Games 2008: 217-228
19EEMark H. M. Winands, Yngvi Björnsson, Jahn-Takeshi Saito: Monte-Carlo Tree Search Solver. Computers and Games 2008: 25-36
2007
18 Vadim Bulitko, Yngvi Björnsson, Mitja Lustrek, Jonathan Schaeffer, Sverrir Sigmundarson: Dynamic Control in Path-Planning with Real-Time Heuristic Search. ICAPS 2007: 49-56
2006
17 H. Jaap van den Herik, Yngvi Björnsson, Nathan S. Netanyahu: Computers and Games, 4th International Conference, CG 2004, Ramat-Gan, Israel, July 5-7, 2004, Revised Papers Springer 2006
16EEYngvi Björnsson, Jonathan Schaeffer, Nathan R. Sturtevant: Partial Information Endgame Databases. ACG 2006: 11-22
15 Yngvi Björnsson, Kári Halldórsson: Improved Heuristics for Optimal Path-finding on Game Maps. AIIDE 2006: 9-14
2005
14EEYngvi Björnsson, Markus Enzenberger, Robert C. Holte, Jonathan Schaeffer: Fringe Search: Beating A* at Pathfinding on Game Maps. CIG 2005
13EEJonathan Schaeffer, Yngvi Björnsson, Neil Burch, Akihiro Kishimoto, Martin Müller, Robert Lake, Paul Lu, Steve Sutphen: Solving Checkers. IJCAI 2005: 292-297
12EERyan Hayward, Yngvi Björnsson, Michael Johanson, Morgan Kan, Nathan Po, Jack van Rijswijck: Solving 7x7 Hex with domination, fill-in, and virtual connections. Theor. Comput. Sci. 349(2): 123-139 (2005)
2003
11 Jonathan Schaeffer, Martin Müller, Yngvi Björnsson: Computers and Games, Third International Conference, CG 2002, Edmonton, Canada, July 25-27, 2002, Revised Papers Springer 2003
10 Jonathan Schaeffer, Yngvi Björnsson, Neil Burch, Robert Lake, Paul Lu, Steve Sutphen: Building the Checkers 10-piece Endgame Databases. ACG 2003: 193-210
9 Darse Billings, Yngvi Björnsson: Search and Knowledge in Lines of Action. ACG 2003: 231-248
8 Ryan Hayward, Yngvi Björnsson, Michael Johanson, Morgan Kan, Nathan Po, Jack van Rijswijck: Solving 7x7 Hex: Virtual Connections and Game-State Reduction. ACG 2003: 261-278
7 Yngvi Björnsson, Markus Enzenberger, Robert Holte, Jonathan Schaeffer, Peter Yap: Comparison of Different Grid Abstractions for Pathfinding on Maps. IJCAI 2003: 1511-1512
6EEYngvi Björnsson, T. Anthony Marsland: Learning extension parameters in game-tree search. Inf. Sci. 154(3-4): 95-118 (2003)
2002
5 Yngvi Björnsson, T. Anthony Marsland: Learning Control of Search Extensions. JCIS 2002: 446-449
2001
4EEYngvi Björnsson, T. Anthony Marsland: Multi-cut alpha-beta-pruning in game-tree search. Theor. Comput. Sci. 252(1-2): 177-196 (2001)
2000
3 Yngvi Björnsson, T. Anthony Marsland: Risk Management in Game-Tree Pruning. Inf. Sci. 122(1): 23-41 (2000)
1998
2EEYngvi Björnsson, T. Anthony Marsland: Multi-cut Pruning in Alpha-Beta Search. Computers and Games 1998: 15-24
1997
1 T. Anthony Marsland, Yngvi Björnsson: From MiniMax to Manhattan. Deep Blue Versus Kasparov: The Significance for Artificial Intelligence 1997: 31-36

Coauthor Index

1Darse Billings [9]
2Vadim Bulitko [18]
3Neil Burch [10] [13]
4Markus Enzenberger [7] [14]
5Hilmar Finnsson [21]
6Kári Halldórsson [15]
7Ryan B. Hayward (Ryan Hayward) [8] [12]
8H. Jaap van den Herik [17]
9Robert C. Holte (Robert Holte) [7] [14]
10Jónheiður Ísleifsdóttir [20]
11Michael Johanson [8] [12]
12Morgan Kan [8] [12]
13Akihiro Kishimoto [13]
14Robert Lake [10] [13]
15Paul Lu [10] [13]
16Mitja Lustrek [18]
17T. Anthony Marsland [1] [2] [3] [4] [5] [6]
18Martin Müller [11] [13]
19Nathan S. Netanyahu [17]
20Nathan Po [8] [12]
21Jack van Rijswijck [8] [12]
22Jahn-Takeshi Saito [19]
23Jonathan Schaeffer [7] [10] [11] [13] [14] [16] [18]
24Sverrir Sigmundarson [18]
25Nathan R. Sturtevant [16]
26Steve Sutphen [10] [13]
27Mark H. M. Winands [19]
28Peter Yap [7]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)