25,161
edits
Changes
Created page with "'''Home * People * Nathan Sturtevant''' FILE:nathansturtevant.jpg|border|right|thumb|link=https://www.movingai.com/| Nathan Sturtevant <ref>[https://www...."
'''[[Main Page|Home]] * [[People]] * Nathan Sturtevant'''
[[FILE:nathansturtevant.jpg|border|right|thumb|link=https://www.movingai.com/| Nathan Sturtevant <ref>[https://www.movingai.com/ Nathan Sturtevant, Moving AI Lab]</ref> ]]
'''Nathan R. Sturtevant''',<br/>
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 [[Games|Multi-Player Games]] from [https://en.wikipedia.org/wiki/University_of_California,_Los_Angeles University of California, Los Angeles] in 2003 under advisor [[Richard Korf]] <ref>[[Nathan Sturtevant]] ('''2003'''). ''Multi-Player Games: Algorithms and Approaches''. Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_California,_Los_Angeles UCLA]</ref>.
Beside Multi-Player Games, his research interests include [[General Game Playing]] and [https://en.wikipedia.org/wiki/Pathfinding Pathfinding].
In 2006 and 2007 he worked with [https://en.wikipedia.org/wiki/BioWare BioWare] to implement a pathfinding engine for the game [https://en.wikipedia.org/wiki/Dragon_Age:_Origins Dragon Age] <ref>[http://webdocs.cs.ualberta.ca/~nathanst/pathfinding.html Nathan Sturtevant @ UAlberta - Pathfinding]</ref>.
=Selected Publications=
<ref>[https://dblp.uni-trier.de/pid/18/991.html dblp: Nathan R. Sturtevant]</ref>
==2000 ...==
* [[Nathan Sturtevant]], [[Richard Korf]] ('''2000'''). ''On Pruning Techniques for Multi-Player Games.'' [[Conferences#AAAI-2000|AAAI-2000]], [http://webdocs.cs.ualberta.ca/~nathanst/papers/multi_prune.pdf pdf]
* [[Nathan Sturtevant]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_8 A Comparison of Algorithms for Multi-player Games]''. [[CG 2002]], [http://webdocs.cs.ualberta.ca/~nathanst/papers/comparison_algorithms.pdf pdf]
* [[Nathan Sturtevant]] ('''2003'''). ''Multi-Player Games: Algorithms and Approaches''. Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_California,_Los_Angeles UCLA]
* [[Nathan Sturtevant]] ('''2004'''). ''[https://link.springer.com/chapter/10.1007/11674399_20 Current Challenges in Multi-player Game Search]''. [[CG 2004]]
==2005 ...==
* [[Yngvi Björnsson]], [[Jonathan Schaeffer]], [[Nathan Sturtevant]] ('''2005'''). ''[https://link.springer.com/chapter/10.1007/11922155_2 Partial Information Endgame Databases]''. [[Advances in Computer Games 11]], [http://webdocs.cs.ualberta.ca/~nathanst/papers/partialEndgameDatabases.pdf pdf], [http://www.ru.is/faculty/yngvi/pdf/BjornssonSS06.pdf pdf]
* [[Nathan Sturtevant]], [[Adam White]] ('''2006'''). ''[https://link.springer.com/chapter/10.1007/978-3-540-75538-8_11 Feature Construction for Reinforcement Learning in Hearts]''. [[CG 2006]], [http://web.cs.du.edu/~sturtevant/papers/heartsfeatures.pdf pdf], [http://webdocs.cs.ualberta.ca/~nathanst/talks/CG2006Talk.pdf slides as pdf] <ref>[https://en.wikipedia.org/wiki/Hearts Hearts from Wikipedia]</ref>
* [[Nathan Sturtevant]] ('''2008'''). ''An Analysis of UCT in Multi-Player Games''. [[ICGA Journal#31_1|ICGA Journal, Vol. 31, No. 1]]
* [[Nathan Sturtevant]] ('''2008'''). ''[https://link.springer.com/chapter/10.1007/978-3-540-87608-3_4 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''. [[Conferences#IJCAI2009|IJCAI 2009]], [http://webdocs.cs.ualberta.ca/~nathanst/papers/TDH.pdf pdf]
* [[Yngvi Björnsson]], [[Vadim Bulitko]], [[Nathan Sturtevant]] ('''2009'''). ''TBA*: Time-Bounded A*''. [[Conferences#IJCAI2009|IJCAI 2009]]
* [[Mesut Kirci]], [[Jonathan Schaeffer]], [[Nathan Sturtevant]] ('''2009'''). ''Feature Learning Using State Differences''. [https://webdocs.cs.ualberta.ca/~jonathan/publications/ai_publications/GGPfeatures.pdf pdf]
==2010 ...==
* [[Jeffrey Long]], [[Nathan Sturtevant]], [[Michael Buro]], [[Timothy Furtak]] ('''2010'''). ''[https://dl.acm.org/doi/10.5555/2898607.2898629 Understanding the Success of Perfect Information Monte Carlo Sampling in Game Tree Search]''. [[Conferences#AAAI-2010|AAAI 2010]], [http://webdocs.cs.ualberta.ca/~nathanst/papers/pimc.pdf pdf]
* [[Ariel Felner]], [[Carsten Moldenhauer]], [[Nathan Sturtevant]], [[Jonathan Schaeffer]] ('''2010'''). ''Single-Frontier Bidirectional Search''. [[Conferences#AAAI-2010|AAAI 2010]], [http://webdocs.cs.ualberta.ca/~jonathan/publications/ai_publications/sfbds.pdf pdf]
* [[Richard Anthony Valenzano]], [[Nathan Sturtevant]], [[Jonathan Schaeffer]], [[Mathematician#KBuro|Karen Buro]], [[Akihiro Kishimoto]] ('''2010'''). ''Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms''. [https://dblp.uni-trier.de/db/conf/aips/icaps2010.html#ValenzanoSSBK10 ICAPS 2010], [http://webdocs.cs.ualberta.ca/~jonathan/publications/ai_publications/dovetailing.pdf pdf]
* [[Nathan Sturtevant]], [[Vadim Bulitko]], [[Yngvi Björnsson]] ('''2010'''). ''[https://www.semanticscholar.org/paper/On-learning-in-agent-centered-search-Sturtevant-Bulitko/db9ebcd72ffd7008bafb91ce9d9110c5682fa0a5 On learning in agent-centered search''. [https://dblp.uni-trier.de/db/conf/atal/aamas2010.html#SturtevantBB10 AAMAS 2010]
* [[Mathematician#MGoldenberg|Meir Goldenberg]], [[Ariel Felner]], [[Nathan Sturtevant]], [[Jonathan Schaeffer]] ('''2010'''). ''Portal-Based True-Distance Heuristics for Path Finding''. [https://dblp.uni-trier.de/db/conf/socs/socs2010.html#GoldenbergFSS10 SOCS-10], [http://webdocs.cs.ualberta.ca/~jonathan/publications/ai_publications/portals.pdf pdf]
* [[Mesut Kirci]], [[Nathan Sturtevant]], [[Jonathan Schaeffer]] ('''2011'''). ''[https://link.springer.com/article/10.1007/s13218-010-0081-8 A GGP Feature Learning Algorithm]''. [https://dblp.uni-trier.de/db/journals/ki/ki25.html#KirciSS11 KI Vol. 25], No. 1
* [[Ariel Felner]], [[Uzi Zahavi]], [[Robert Holte]], [[Jonathan Schaeffer]], [[Nathan Sturtevant]], [[Zhifu Zhang]] ('''2011'''). ''Inconsistent Heuristics in Theory and Practice''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 175, Nos. 9-10, [https://webdocs.cs.ualberta.ca/~jonathan/publications/ai_publications/inconsistent_heuristics_draft.pdf pdf]
* [[Nathan Sturtevant]], [[Ariel Felner]], [[Maxim Likhachev]], [[Wheeler Rum]] ('''2012'''). ''[https://www.semanticscholar.org/paper/Heuristic-Search-Comes-of-Age-Sturtevant-Felner/18e0bf9e6f28e151c0cf60ba1e962f0c1fb6ed23 Heuristic Search Comes of Age]''. [[Conferences#AAAI-2012|AAAI 2012]]
* [[Max Roschke]], [[Nathan Sturtevant]] ('''2013'''). ''UCT Enhancements in Chinese Checkers Using an Endgame Database''. [[Conferences#IJCAI2013|CGW@IJCAI 2013]], [https://webdocs.cs.ualberta.ca/~nathanst/papers/UCT-endgame.pdf pdf]
* [[Marc Lanctot]], [[Mark Winands]], [[Tom Pepels]], [[Nathan Sturtevant]] ('''2014'''). ''Monte Carlo Tree Search with Heuristic Evaluations using Implicit Minimax Backups''. [https://dblp.uni-trier.de/db/conf/cig/cig2014.html#LanctotWPS14 CIG 2014], [https://arxiv.org/abs/1406.0486 arXiv:1406.0486]
* [[Guni Sharon]], [[Ariel Felner]], [[Nathan Sturtevant]] ('''2014'''). ''Exponential Deepening A* for Real-Time Agent-Centered Search''. [[Conferences#AAAI-2014|AAAI 2014]] <ref>[https://en.wikipedia.org/wiki/IDA* IDA* from WIkipedia]</ref>
* [[Mathematician#MGoldenberg|Meir Goldenberg]], [[Ariel Felner]], [[Mathematician#RoniStern|Roni Stern]], [[Guni Sharon]], [[Nathan Sturtevant]], [[Robert Holte|Robert C. Holte]], [[Jonathan Schaeffer]] ('''2014'''). ''[https://www.jair.org/index.php/jair/article/view/10882 Enhanced Partial Expansion A*]''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research Journal of Artificial Intelligence Research], Vol. 50
==2015 ...==
* [[Nathan Sturtevant]] ('''2015'''). ''Challenges and Progress on Using Large Lossy Endgame Databases in Chinese Checkers''. [[Conferences#IJCAI2015|CGW@IJCAI 2015]]
* [[Mathematician#MGoldenberg|Meir Goldenberg]], [[Ariel Felner]], [[Alon Palombo]], [[Nathan Sturtevant]], [[Jonathan Schaeffer]] ('''2017'''). ''[https://content.iospress.com/articles/ai-communications/aic743 The compressed differential heuristic]''. [https://www.iospress.nl/journal/ai-communications/ AI Communications], Vol. 30, No. 6
* [[Nathan Sturtevant]], [[Ariel Felner]] ('''2018'''). ''A Brief History and Recent Achievements in Bidirectional Search''. [[Conferences#AAAI-2018|AAAI 2018]]
* [[Shuli Hu]], [[Nathan Sturtevant]] ('''2019'''). ''[https://www.ijcai.org/Proceedings/2019/175 Direction-Optimizing Breadth-First Search with External Memory Storage]''. [[Conferences#IJCAI2019|IJCAI 2019]]
* [[Nathan Sturtevant]] ('''2019'''). ''[https://link.springer.com/chapter/10.1007/978-3-030-65883-0_13 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#41_2|ICGA Journal, Vol. 41, No. 2]]
==2020 ...==
* [[Dor Atzmon]], [[Jiaoyang Li]], [[Ariel Felner]], [[Eliran Nachmani]], [[Shahaf S. Shperberg]], [[Nathan Sturtevant]], [[Mathematician#SKoenig|Sven Koenig]] ('''2020'''). ''[https://www.ijcai.org/Proceedings/2020/562 Multi-Directional Heuristic Search]''. [[Conferences#IJCAI2020|IJCAI 2020]]
* [[Dor Atzmon]], [[Mathematician#RoniStern|Roni Stern]], [[Ariel Felner]], [[Nathan Sturtevant]], [[Mathematician#SKoenig|Sven Koenig]] ('''2020'''). ''[https://ojs.aaai.org//index.php/ICAPS/article/view/6642 Probabilistic Robust Multi-Agent Path Finding]''. [https://dblp.uni-trier.de/db/conf/aips/icaps2020.html#AtzmonSFSK20 ICAPS 2020]
=External Links=
* [https://www.movingai.com/ Nathan Sturtevant, Moving AI Lab]
* [http://ns-software.com/ NS Software]
* [https://scholar.google.com/citations?user=3utEUeoAAAAJ&hl=en Nathan Sturtevant - Google Scholar]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Researcher|Sturtevant]]
[[Category:Programmer|Sturtevant]]
[[FILE:nathansturtevant.jpg|border|right|thumb|link=https://www.movingai.com/| Nathan Sturtevant <ref>[https://www.movingai.com/ Nathan Sturtevant, Moving AI Lab]</ref> ]]
'''Nathan R. Sturtevant''',<br/>
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 [[Games|Multi-Player Games]] from [https://en.wikipedia.org/wiki/University_of_California,_Los_Angeles University of California, Los Angeles] in 2003 under advisor [[Richard Korf]] <ref>[[Nathan Sturtevant]] ('''2003'''). ''Multi-Player Games: Algorithms and Approaches''. Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_California,_Los_Angeles UCLA]</ref>.
Beside Multi-Player Games, his research interests include [[General Game Playing]] and [https://en.wikipedia.org/wiki/Pathfinding Pathfinding].
In 2006 and 2007 he worked with [https://en.wikipedia.org/wiki/BioWare BioWare] to implement a pathfinding engine for the game [https://en.wikipedia.org/wiki/Dragon_Age:_Origins Dragon Age] <ref>[http://webdocs.cs.ualberta.ca/~nathanst/pathfinding.html Nathan Sturtevant @ UAlberta - Pathfinding]</ref>.
=Selected Publications=
<ref>[https://dblp.uni-trier.de/pid/18/991.html dblp: Nathan R. Sturtevant]</ref>
==2000 ...==
* [[Nathan Sturtevant]], [[Richard Korf]] ('''2000'''). ''On Pruning Techniques for Multi-Player Games.'' [[Conferences#AAAI-2000|AAAI-2000]], [http://webdocs.cs.ualberta.ca/~nathanst/papers/multi_prune.pdf pdf]
* [[Nathan Sturtevant]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_8 A Comparison of Algorithms for Multi-player Games]''. [[CG 2002]], [http://webdocs.cs.ualberta.ca/~nathanst/papers/comparison_algorithms.pdf pdf]
* [[Nathan Sturtevant]] ('''2003'''). ''Multi-Player Games: Algorithms and Approaches''. Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_California,_Los_Angeles UCLA]
* [[Nathan Sturtevant]] ('''2004'''). ''[https://link.springer.com/chapter/10.1007/11674399_20 Current Challenges in Multi-player Game Search]''. [[CG 2004]]
==2005 ...==
* [[Yngvi Björnsson]], [[Jonathan Schaeffer]], [[Nathan Sturtevant]] ('''2005'''). ''[https://link.springer.com/chapter/10.1007/11922155_2 Partial Information Endgame Databases]''. [[Advances in Computer Games 11]], [http://webdocs.cs.ualberta.ca/~nathanst/papers/partialEndgameDatabases.pdf pdf], [http://www.ru.is/faculty/yngvi/pdf/BjornssonSS06.pdf pdf]
* [[Nathan Sturtevant]], [[Adam White]] ('''2006'''). ''[https://link.springer.com/chapter/10.1007/978-3-540-75538-8_11 Feature Construction for Reinforcement Learning in Hearts]''. [[CG 2006]], [http://web.cs.du.edu/~sturtevant/papers/heartsfeatures.pdf pdf], [http://webdocs.cs.ualberta.ca/~nathanst/talks/CG2006Talk.pdf slides as pdf] <ref>[https://en.wikipedia.org/wiki/Hearts Hearts from Wikipedia]</ref>
* [[Nathan Sturtevant]] ('''2008'''). ''An Analysis of UCT in Multi-Player Games''. [[ICGA Journal#31_1|ICGA Journal, Vol. 31, No. 1]]
* [[Nathan Sturtevant]] ('''2008'''). ''[https://link.springer.com/chapter/10.1007/978-3-540-87608-3_4 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''. [[Conferences#IJCAI2009|IJCAI 2009]], [http://webdocs.cs.ualberta.ca/~nathanst/papers/TDH.pdf pdf]
* [[Yngvi Björnsson]], [[Vadim Bulitko]], [[Nathan Sturtevant]] ('''2009'''). ''TBA*: Time-Bounded A*''. [[Conferences#IJCAI2009|IJCAI 2009]]
* [[Mesut Kirci]], [[Jonathan Schaeffer]], [[Nathan Sturtevant]] ('''2009'''). ''Feature Learning Using State Differences''. [https://webdocs.cs.ualberta.ca/~jonathan/publications/ai_publications/GGPfeatures.pdf pdf]
==2010 ...==
* [[Jeffrey Long]], [[Nathan Sturtevant]], [[Michael Buro]], [[Timothy Furtak]] ('''2010'''). ''[https://dl.acm.org/doi/10.5555/2898607.2898629 Understanding the Success of Perfect Information Monte Carlo Sampling in Game Tree Search]''. [[Conferences#AAAI-2010|AAAI 2010]], [http://webdocs.cs.ualberta.ca/~nathanst/papers/pimc.pdf pdf]
* [[Ariel Felner]], [[Carsten Moldenhauer]], [[Nathan Sturtevant]], [[Jonathan Schaeffer]] ('''2010'''). ''Single-Frontier Bidirectional Search''. [[Conferences#AAAI-2010|AAAI 2010]], [http://webdocs.cs.ualberta.ca/~jonathan/publications/ai_publications/sfbds.pdf pdf]
* [[Richard Anthony Valenzano]], [[Nathan Sturtevant]], [[Jonathan Schaeffer]], [[Mathematician#KBuro|Karen Buro]], [[Akihiro Kishimoto]] ('''2010'''). ''Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms''. [https://dblp.uni-trier.de/db/conf/aips/icaps2010.html#ValenzanoSSBK10 ICAPS 2010], [http://webdocs.cs.ualberta.ca/~jonathan/publications/ai_publications/dovetailing.pdf pdf]
* [[Nathan Sturtevant]], [[Vadim Bulitko]], [[Yngvi Björnsson]] ('''2010'''). ''[https://www.semanticscholar.org/paper/On-learning-in-agent-centered-search-Sturtevant-Bulitko/db9ebcd72ffd7008bafb91ce9d9110c5682fa0a5 On learning in agent-centered search''. [https://dblp.uni-trier.de/db/conf/atal/aamas2010.html#SturtevantBB10 AAMAS 2010]
* [[Mathematician#MGoldenberg|Meir Goldenberg]], [[Ariel Felner]], [[Nathan Sturtevant]], [[Jonathan Schaeffer]] ('''2010'''). ''Portal-Based True-Distance Heuristics for Path Finding''. [https://dblp.uni-trier.de/db/conf/socs/socs2010.html#GoldenbergFSS10 SOCS-10], [http://webdocs.cs.ualberta.ca/~jonathan/publications/ai_publications/portals.pdf pdf]
* [[Mesut Kirci]], [[Nathan Sturtevant]], [[Jonathan Schaeffer]] ('''2011'''). ''[https://link.springer.com/article/10.1007/s13218-010-0081-8 A GGP Feature Learning Algorithm]''. [https://dblp.uni-trier.de/db/journals/ki/ki25.html#KirciSS11 KI Vol. 25], No. 1
* [[Ariel Felner]], [[Uzi Zahavi]], [[Robert Holte]], [[Jonathan Schaeffer]], [[Nathan Sturtevant]], [[Zhifu Zhang]] ('''2011'''). ''Inconsistent Heuristics in Theory and Practice''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 175, Nos. 9-10, [https://webdocs.cs.ualberta.ca/~jonathan/publications/ai_publications/inconsistent_heuristics_draft.pdf pdf]
* [[Nathan Sturtevant]], [[Ariel Felner]], [[Maxim Likhachev]], [[Wheeler Rum]] ('''2012'''). ''[https://www.semanticscholar.org/paper/Heuristic-Search-Comes-of-Age-Sturtevant-Felner/18e0bf9e6f28e151c0cf60ba1e962f0c1fb6ed23 Heuristic Search Comes of Age]''. [[Conferences#AAAI-2012|AAAI 2012]]
* [[Max Roschke]], [[Nathan Sturtevant]] ('''2013'''). ''UCT Enhancements in Chinese Checkers Using an Endgame Database''. [[Conferences#IJCAI2013|CGW@IJCAI 2013]], [https://webdocs.cs.ualberta.ca/~nathanst/papers/UCT-endgame.pdf pdf]
* [[Marc Lanctot]], [[Mark Winands]], [[Tom Pepels]], [[Nathan Sturtevant]] ('''2014'''). ''Monte Carlo Tree Search with Heuristic Evaluations using Implicit Minimax Backups''. [https://dblp.uni-trier.de/db/conf/cig/cig2014.html#LanctotWPS14 CIG 2014], [https://arxiv.org/abs/1406.0486 arXiv:1406.0486]
* [[Guni Sharon]], [[Ariel Felner]], [[Nathan Sturtevant]] ('''2014'''). ''Exponential Deepening A* for Real-Time Agent-Centered Search''. [[Conferences#AAAI-2014|AAAI 2014]] <ref>[https://en.wikipedia.org/wiki/IDA* IDA* from WIkipedia]</ref>
* [[Mathematician#MGoldenberg|Meir Goldenberg]], [[Ariel Felner]], [[Mathematician#RoniStern|Roni Stern]], [[Guni Sharon]], [[Nathan Sturtevant]], [[Robert Holte|Robert C. Holte]], [[Jonathan Schaeffer]] ('''2014'''). ''[https://www.jair.org/index.php/jair/article/view/10882 Enhanced Partial Expansion A*]''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research Journal of Artificial Intelligence Research], Vol. 50
==2015 ...==
* [[Nathan Sturtevant]] ('''2015'''). ''Challenges and Progress on Using Large Lossy Endgame Databases in Chinese Checkers''. [[Conferences#IJCAI2015|CGW@IJCAI 2015]]
* [[Mathematician#MGoldenberg|Meir Goldenberg]], [[Ariel Felner]], [[Alon Palombo]], [[Nathan Sturtevant]], [[Jonathan Schaeffer]] ('''2017'''). ''[https://content.iospress.com/articles/ai-communications/aic743 The compressed differential heuristic]''. [https://www.iospress.nl/journal/ai-communications/ AI Communications], Vol. 30, No. 6
* [[Nathan Sturtevant]], [[Ariel Felner]] ('''2018'''). ''A Brief History and Recent Achievements in Bidirectional Search''. [[Conferences#AAAI-2018|AAAI 2018]]
* [[Shuli Hu]], [[Nathan Sturtevant]] ('''2019'''). ''[https://www.ijcai.org/Proceedings/2019/175 Direction-Optimizing Breadth-First Search with External Memory Storage]''. [[Conferences#IJCAI2019|IJCAI 2019]]
* [[Nathan Sturtevant]] ('''2019'''). ''[https://link.springer.com/chapter/10.1007/978-3-030-65883-0_13 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#41_2|ICGA Journal, Vol. 41, No. 2]]
==2020 ...==
* [[Dor Atzmon]], [[Jiaoyang Li]], [[Ariel Felner]], [[Eliran Nachmani]], [[Shahaf S. Shperberg]], [[Nathan Sturtevant]], [[Mathematician#SKoenig|Sven Koenig]] ('''2020'''). ''[https://www.ijcai.org/Proceedings/2020/562 Multi-Directional Heuristic Search]''. [[Conferences#IJCAI2020|IJCAI 2020]]
* [[Dor Atzmon]], [[Mathematician#RoniStern|Roni Stern]], [[Ariel Felner]], [[Nathan Sturtevant]], [[Mathematician#SKoenig|Sven Koenig]] ('''2020'''). ''[https://ojs.aaai.org//index.php/ICAPS/article/view/6642 Probabilistic Robust Multi-Agent Path Finding]''. [https://dblp.uni-trier.de/db/conf/aips/icaps2020.html#AtzmonSFSK20 ICAPS 2020]
=External Links=
* [https://www.movingai.com/ Nathan Sturtevant, Moving AI Lab]
* [http://ns-software.com/ NS Software]
* [https://scholar.google.com/citations?user=3utEUeoAAAAJ&hl=en Nathan Sturtevant - Google Scholar]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Researcher|Sturtevant]]
[[Category:Programmer|Sturtevant]]
