Nathan Sturtevant

Home * People * Nathan Sturtevant

Nathan Sturtevant [1] Nathan R. Sturtevant,

an American computer scientist, games- and AI-researcher and programmer, and professor at Department of Computing Science, University of Alberta. He received his Ph.D. on Multi-Player Games from University of California, Los Angeles in 2003 under advisor Richard Korf [2]. Beside Multi-Player Games, his research interests include General Game Playing and Pathfinding. In 2006 and 2007 he worked with BioWare to implement a pathfinding engine for the game Dragon Age [3].

2000 …#

• Nathan Sturtevant, Richard Korf (2000). On Pruning Techniques for Multi-Player Games. AAAI-2000, pdf
• Nathan Sturtevant (2002). A Comparison of Algorithms for Multi-player Games. CG 2002, pdf
• Nathan Sturtevant (2003). Multi-Player Games: Algorithms and Approaches. Ph.D. thesis, UCLA
• Nathan Sturtevant (2004). Current Challenges in Multi-player Game Search. CG 2004

2005 …#

• Yngvi Björnsson, Jonathan Schaeffer, Nathan Sturtevant (2005). Partial Information Endgame Databases. Advances in Computer Games 11, pdf, pdf
• Nathan Sturtevant, Adam White (2006). Feature Construction for Reinforcement Learning in Hearts. CG 2006, pdf, slides as pdf [5]
• Nathan Sturtevant (2008). An Analysis of UCT in Multi-Player Games. ICGA Journal, Vol. 31, No. 1
• Nathan Sturtevant (2008). An Analysis of UCT in Multi-player Games. CG 2008
• Nathan Sturtevant, Ariel Felner, Max Barrer, Jonathan Schaeffer, Neil Burch (2009). Memory-Based Heuristics for Explicit State Spaces. IJCAI 2009, pdf
• Yngvi Björnsson, Vadim Bulitko, Nathan Sturtevant (2009). TBA*: Time-Bounded A*. IJCAI 2009
• Mesut Kirci, Jonathan Schaeffer, Nathan Sturtevant (2009). Feature Learning Using State Differences. pdf

2010 …#

• Jeffrey Long, Nathan Sturtevant, Michael Buro, Timothy Furtak (2010). Understanding the Success of Perfect Information Monte Carlo Sampling in Game Tree Search. AAAI 2010, pdf
• Ariel Felner, Carsten Moldenhauer, Nathan Sturtevant, Jonathan Schaeffer (2010). Single-Frontier Bidirectional Search. AAAI 2010, pdf
• Richard Anthony Valenzano, Nathan Sturtevant, Jonathan Schaeffer, Karen Buro, Akihiro Kishimoto (2010). Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms. ICAPS 2010, pdf
• Nathan Sturtevant, Vadim Bulitko, Yngvi Björnsson (2010). [On learning in agent-centered search. https://dblp.uni-trier.de/db/conf/atal/aamas2010.html#SturtevantBB10 AAMAS 2010
• Meir Goldenberg, Ariel Felner, Nathan Sturtevant, Jonathan Schaeffer (2010). Portal-Based True-Distance Heuristics for Path Finding. SOCS-10, pdf
• Mesut Kirci, Nathan Sturtevant, Jonathan Schaeffer (2011). A GGP Feature Learning Algorithm. KI Vol. 25, No. 1
• Ariel Felner, Uzi Zahavi, Robert Holte, Jonathan Schaeffer, Nathan Sturtevant, Zhifu Zhang (2011). Inconsistent Heuristics in Theory and Practice. Artificial Intelligence, Vol. 175, Nos. 9-10, pdf
• Nathan Sturtevant, Ariel Felner, Maxim Likhachev, Wheeler Rum (2012). Heuristic Search Comes of Age. AAAI 2012
• Max Roschke, Nathan Sturtevant (2013). UCT Enhancements in Chinese Checkers Using an Endgame Database. CGW@IJCAI 2013, pdf
• Marc Lanctot, Mark Winands, Tom Pepels, Nathan Sturtevant (2014). Monte Carlo Tree Search with Heuristic Evaluations using Implicit Minimax Backups. CIG 2014, arXiv:1406.0486
• Guni Sharon, Ariel Felner, Nathan Sturtevant (2014). Exponential Deepening A* for Real-Time Agent-Centered Search. AAAI 2014 [6]
• Meir Goldenberg, Ariel Felner, Roni Stern, Guni Sharon, Nathan Sturtevant, Robert C. Holte, Jonathan Schaeffer (2014). Enhanced Partial Expansion A*. Journal of Artificial Intelligence Research, Vol. 50

2015 …#

• Nathan Sturtevant (2015). Challenges and Progress on Using Large Lossy Endgame Databases in Chinese Checkers. CGW@IJCAI 2015
• Meir Goldenberg, Ariel Felner, Alon Palombo, Nathan Sturtevant, Jonathan Schaeffer (2017). The compressed differential heuristic. AI Communications, Vol. 30, No. 6
• Nathan Sturtevant, Ariel Felner (2018). A Brief History and Recent Achievements in Bidirectional Search. AAAI 2018
• Shuli Hu, Nathan Sturtevant (2019). Direction-Optimizing Breadth-First Search with External Memory Storage. IJCAI 2019
• Nathan Sturtevant (2019). On Strongly Solving Chinese Checkers. Advances in Computer Games 16
• Tristan Cazenave, Abdallah Saffidine, Nathan Sturtevant (2019). Computer Games Workshop at IJCAI 2018. ICGA Journal, Vol. 41, No. 2

2020 …#

• Dor Atzmon, Jiaoyang Li, Ariel Felner, Eliran Nachmani, Shahaf S. Shperberg, Nathan Sturtevant, Sven Koenig (2020). Multi-Directional Heuristic Search. IJCAI 2020
• Dor Atzmon, Roni Stern, Ariel Felner, Nathan Sturtevant, Sven Koenig (2020). Probabilistic Robust Multi-Agent Path Finding. ICAPS 2020

External Links#

• Nathan Sturtevant, Moving AI Lab
• NS Software
• Nathan Sturtevant‬ - ‪Google Scholar‬

References#

1. ↑ Nathan Sturtevant, Moving AI Lab
2. ↑ Nathan Sturtevant (2003). Multi-Player Games: Algorithms and Approaches. Ph.D. thesis, UCLA
3. ↑ Nathan Sturtevant @ UAlberta - Pathfinding
4. ↑ dblp: Nathan R. Sturtevant
5. ↑ Hearts from Wikipedia
6. ↑ IDA* from WIkipedia

Up one level