Yngvi Björnsson

	2011
34		Mark H. M. Winands, Yngvi Björnsson: αβ-based play-outs in Monte-Carlo Tree Search. CIG 2011: 110-117
33		Hilmar Finnsson, Yngvi Björnsson: CadiaPlayer: Search-Control Techniques. KI 25(1): 9-16 (2011)
	2010
32		Hilmar Finnsson, Yngvi Björnsson: Learning Simulation Control in General Game-Playing Agents. AAAI 2010
31		Nathan R. Sturtevant, Vadim Bulitko, Yngvi Björnsson: On learning in agent-centered search. AAMAS 2010: 333-340
30		Mark H. M. Winands, Yngvi Björnsson, Jahn-Takeshi Saito: Monte Carlo Tree Search in Lines of Action. IEEE Trans. Comput. Intellig. and AI in Games 2(4): 239-250 (2010)
29		Vadim Bulitko, Yngvi Björnsson, Ramon Lawrence: Case-Based Subgoaling in Real-Time Heuristic Search for Video Game Pathfinding. J. Artif. Intell. Res. (JAIR) 39: 269-300 (2010)
	2009
28		Pálmi Skowronski, Yngvi Björnsson, Mark H. M. Winands: Automated Discovery of Search-Extension Features. ACG 2009: 182-194
27		Mark H. M. Winands, Yngvi Björnsson: Evaluation Function Based Monte-Carlo LOA. ACG 2009: 33-44
26		Vadim Bulitko, Yngvi Björnsson: kNN LRTA*: Simple Subgoaling for Real-Time Search. AIIDE 2009
25		Yngvi Björnsson: General game-playing systems. CIG 2009
24		Yngvi Björnsson, Vadim Bulitko, Nathan R. Sturtevant: TBA*: Time-Bounded A*. IJCAI 2009: 431-436
23		Yngvi Björnsson, Hilmar Finnsson: CadiaPlayer: A Simulation-Based General Game Player. IEEE Trans. Comput. Intellig. and AI in Games 1(1): 4-15 (2009)
	2008
22		Hilmar Finnsson, Yngvi Björnsson: Simulation-Based Approach to General Game Playing. AAAI 2008: 259-264
21		Jónheiður Ísleifsdóttir, Yngvi Björnsson: GTQ: A Language and Tool for Game-Tree Analysis. Computers and Games 2008: 217-228
20		Mark H. M. Winands, Yngvi Björnsson, Jahn-Takeshi Saito: Monte-Carlo Tree Search Solver. Computers and Games 2008: 25-36
19		Vadim Bulitko, Mitja Lustrek, Jonathan Schaeffer, Yngvi Björnsson, Sverrir Sigmundarson: Dynamic Control in Real-Time Heuristic Search. J. Artif. Intell. Res. (JAIR) 32: 419-452 (2008)
	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
16		Yngvi 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
14		Yngvi Björnsson, Markus Enzenberger, Robert C. Holte, Jonathan Schaeffer: Fringe Search: Beating A* at Pathfinding on Game Maps. CIG 2005
13		Jonathan Schaeffer, Yngvi Björnsson, Neil Burch, Akihiro Kishimoto, Martin Müller, Robert Lake, Paul Lu, Steve Sutphen: Solving Checkers. IJCAI 2005: 292-297
12		Ryan 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
6		Yngvi 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
4		Yngvi 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
2		Yngvi 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

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

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page