Nathan R. Sturtevant

Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2023

Entropy as a Measure of Puzzle Difficulty.

[BibT_eX]

[DOI]

Eugene You Chen Chen

Adam White

Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2023

Analyzing and Improving the Use of the FastMap Embedding in Pathfinding Tasks.

[BibT_eX]

[DOI]

Reza Mashayekhi

Dor Atzmon

João Gabriel Gama Vila Nova

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Optimal Search with Neural Networks: Challenges and Approaches.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Learning Curricula for Humans: An Empirical Study with Puzzles from The Witness.

[BibT_eX]

[DOI]

Levi H. S. Lelis

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Efficient Budgeted Graph Search.

[BibT_eX]

[DOI]

Jasmeet Kaur

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

An Efficient Chinese Checkers Implementation: Ranking, Bitboards, and BMI2 pext and pdep Instructions.

[BibT_eX]

[DOI]

Proceedings of the Computers and Games - International Conference, 2022

Multi-Agent Path Finding with Temporal Jump Point Search.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

Adventures of AI Directors Early in the Development of Nightingale.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2022

FarmQuest: A Demonstration of an AI Director Video Game Test Bed.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2022

2021

Avoiding Re-expansions in Suboptimal Best-First Search.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

Towards Disambiguating Quests as a Technical Term.

[BibT_eX]

[DOI]

Proceedings of the FDG'21: The 16th International Conference on the Foundations of Digital Games 2021, 2021

Conflict-Based Increasing Cost Search.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

Iterative-deepening Bidirectional Heuristic Search with Restricted Memory.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

Jump Point Search with Temporal Obstacles.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

The Definition-Context-Purpose Paradigm and Other Insights from Industry Professionals about the Definition of a Quest.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2021

The Impact of Visualizing Design Gradients for Human Designers.

[BibT_eX]

[DOI]

Carolyn Yang

Proceedings of the Seventeenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2021

Necessary and Sufficient Conditions for Avoiding Reopenings in Best First Suboptimal Search with General Bounding Functions.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

A Guide to Budgeted Tree Search.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

Multi-Directional Search.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

Bidirectional Heuristic Search: Expanding Nodes by a Lower Bound.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Multi-Directional Heuristic Search.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Predicting the Effectiveness of Bidirectional Heuristic Search.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

Probabilistic Robust Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

What is a Quest?

[BibT_eX]

[DOI]

Proceedings of the Joint Proceedings of the AIIDE 2020 Workshops co-located with 16th AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE 2020), 2020

A Demonstration of Anhinga: A Mixed-Initiative EPCG Tool for Snakebird.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2020

The Unexpected Consequence of Incremental Design Changes.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2020

Generalized and Sub-Optimal Bipartite Constraints for Conflict-Based Search.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Abstraction and Refinement in Games with Dynamic Weighted Terrain.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Computer Games Workshop at IJCAI 2018.

[BibT_eX]

[DOI]

Tristan Cazenave

Abdallah Saffidine

J. Int. Comput. Games Assoc., 2019

Exponential-Binary State-Space Search.

[BibT_eX]

[DOI]

CoRR, 2019

Unbounded Sub-Optimal Conflict-Based Search in Complex Domains.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Enriching Non-Parametric Bidirectional Search Algorithms - Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Improving Bidirectional Heuristic Search by Bounds Propagation.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Revisiting Suboptimal Search.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Optimally Efficient Bidirectional Search.

[BibT_eX]

[DOI]

Eshed Shaham

Jeffrey S. Rosenschein

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Direction-Optimizing Breadth-First Search with External Memory Storage.

[BibT_eX]

[DOI]

Shuli Hu

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Iterative Budgeted Exponential Search.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Conditions for Avoiding Node Re-expansions in Bounded Suboptimal Search.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Application of Retrograde Analysis on Fighting Games.

[BibT_eX]

[DOI]

Kristen Yu

Proceedings of the IEEE Conference on Games, 2019

Policy Based Inference in Trick-Taking Card Games.

[BibT_eX]

[DOI]

Proceedings of the IEEE Conference on Games, 2019

Pathfinding and Abstraction with Dynamic Terrain Costs.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2019

On Strongly Solving Chinese Checkers.

[BibT_eX]

[DOI]

Proceedings of the Advances in Computer Games - 16th International Conference, 2019

Exploring EPCG in The Witness.

[BibT_eX]

[DOI]

Proceedings of the 2nd Workshop on Knowledge Extraction from Games co-located with 33rd AAAI Conference on Artificial Intelligence, 2019

Enriching Non-Parametric Bidirectional Search Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

AI education matters: teaching search algorithms.

[BibT_eX]

[DOI]

AI Matters, 2018

Minimizing Node Expansions in Bidirectional Search with Consistent Heuristics.

[BibT_eX]

[DOI]

Eshed Shaham

Jeffrey S. Rosenschein

Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

Benchmarks for Pathfinding in 3D Voxel Space.

[BibT_eX]

[DOI]

Daniel Brewer

Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

Rapid Randomized Restarts for Multi-Agent Path Finding Solvers.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

Extended Increasing Cost Tree Search for Non-Unit Cost Domains.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Rapid Randomized Restarts for Multi-Agent Path Finding: Preliminary Results.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

Exhaustive and Semi-Exhaustive Procedural Content Generation.

[BibT_eX]

[DOI]

Matheus Jun Ota

Proceedings of the Fourteenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2018

A Brief History and Recent Achievements in Bidirectional Search.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

Reports of the Workshops of the Thirty-First AAAI Conference on Artificial Intelligence.

[BibT_eX]

[DOI]

AI Mag., 2017

The compressed differential heuristic.

[BibT_eX]

[DOI]

AI Commun., 2017

MM: A bidirectional search algorithm that is guaranteed to meet in the middle.

[BibT_eX]

[DOI]

Artif. Intell., 2017

The Minimal Set of States that Must Be Expanded in a Front-to-End Bidirectional Search.

[BibT_eX]

[DOI]

Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

On Variable Dependencies and Compressed Pattern Databases.

[BibT_eX]

[DOI]

Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges.

[BibT_eX]

[DOI]

Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

A Study of Forward Versus Backwards Endgame Solvers with Results in Chinese Checkers.

[BibT_eX]

[DOI]

Abdallah Saffidine

Proceedings of the Computer Games - 6th Workshop, 2017

Front-to-End Bidirectional Heuristic Search with Near-Optimal Node Expansions.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Using Hierarchical Constraints to Avoid Conflicts in Multi-Agent Pathfinding.

[BibT_eX]

[DOI]

David M. Chan

Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

Sufficient Conditions for Node Expansion in Bidirectional Heuristic Search.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

The State of the AIIDE Conference in 2017.

[BibT_eX]

[DOI]

Brian Magerko

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Value Compression of Pattern Databases.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Guest Editorial: Physics-Based Simulation Games.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Intell. AI Games, 2016

Scrubbing During Learning In Real-time Heuristic Search.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2016

Generalizing JPS Symmetry Detection: Canonical Orderings on Graphs.

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual Symposium on Combinatorial Search, 2016

Extended Abstract: An Improved Priority Function for Bidirectional Heuristic Search.

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual Symposium on Combinatorial Search, 2016

Canonical Orderings on Grids.

[BibT_eX]

[DOI]

Steve Rabin

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

External Memory Bidirectional Search.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Combining Bounding Boxes and JPS to Prune Grid Pathfinding.

[BibT_eX]

[DOI]

Steve Rabin

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

Bidirectional Search That Is Guaranteed to Meet in the Middle.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015

A Summary of the Twenty-Ninth AAAI Conference on Artificial Intelligence.

[BibT_eX]

[DOI]

George Dimitri Konidaris

AI Mag., 2015

Conflict-based search for optimal multi-agent pathfinding.

[BibT_eX]

[DOI]

Artif. Intell., 2015

The Grid-Based Path Planning Competition: 2014 Entries and Results.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual Symposium on Combinatorial Search, 2015

Challenges and Progress on Using Large Lossy Endgame Databases in Chinese Checkers.

[BibT_eX]

[DOI]

Proceedings of the Computer Games - Fourth Workshop on Computer Games, 2015

2014

Guest Editorial: General Games.

[BibT_eX]

[DOI]

Cameron Browne

Julian Togelius

IEEE Trans. Comput. Intell. AI Games, 2014

Enhanced Partial Expansion A.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2014

The Grid-Based Path Planning Competition.

[BibT_eX]

[DOI]

AI Mag., 2014

The Fifth Annual Symposium on Combinatorial Search.

[BibT_eX]

[DOI]

AI Commun., 2014

Exploiting the Rubik's Cube 12-Edge PDB by Combining Partial Pattern Databases and Bloom Filters.

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

Reaching the Goal in Real-Time Heuristic Search: Scrubbing Behavior is Unavoidable.

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

Estimating Search Tree Size with Duplicate Detection.

[BibT_eX]

[DOI]

Levi H. S. Lelis

Roni Stern

Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

Monte Carlo Tree Search with heuristic evaluations using implicit minimax backups.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE Conference on Computational Intelligence and Games, 2014

A Comparison of Knowledge-Based GBFS Enhancements and Knowledge-Free Exploration.

[BibT_eX]

[DOI]

Squirrel (Brian) Eiserloh

Fan Xie

Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, 2014

Playable Experiences at AIIDE 2014.

[BibT_eX]

[DOI]

Alejandro Ramirez-Sanabria

Kieran Lord

Proceedings of the Tenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2014

Worst-Case Solution Quality Analysis When Not Re-Expanding Nodes in Best-First Search.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Exponential Deepening A* for Real-Time Agent-Centered Search.

[BibT_eX]

[DOI]

Guni Sharon

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013

Online Detection of Dead States in Real-Time Agent-Centered Search.

[BibT_eX]

[DOI]

Guni Sharon

Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

Optimal-Generation Variants of EPEA.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

Finding Bounded Suboptimal Multi-Agent Path Planning Solutions Using Increasing Cost Tree Search (Extended Abstract).

[BibT_eX]

[DOI]

Faten Aljalaud

Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

External Memory PDBs: Initial Results.

[BibT_eX]

[DOI]

Proceedings of the Tenth Symposium on Abstraction, Reformulation, and Approximation, 2013

Minimizing Writes in Parallel External Memory Search.

[BibT_eX]

[DOI]

Matthew J. Rutherford

Proceedings of the IJCAI 2013, 2013

UCT Enhancements in Chinese Checkers Using an Endgame Database.

[BibT_eX]

[DOI]

Max Roschke

Proceedings of the Computer Games - Workshop on Computer Games, 2013

Subset Selection of Search Heuristics.

[BibT_eX]

[DOI]

D. Chris Rayner

Michael Bowling

Proceedings of the IJCAI 2013, 2013

A parameterized family of equilibrium profiles for three-player kuhn poker.

[BibT_eX]

[DOI]

Duane Szafron

Richard G. Gibson

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

Using Alternative Suboptimality Bounds in Heuristic Search.

[BibT_eX]

[DOI]

Shahab Jabbari Arfaee

Jordan Tyler Thayer

Roni Stern

Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

An Argument for Large-Scale Breadth-First Search for Game Design and Content Generation via a Case Study of Fling!

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligencein the Game Design Process 2, 2013

Incorporating Human Relationships Into Path Planning.

[BibT_eX]

[DOI]

Proceedings of the Ninth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2013

Partial Domain Search Tree For Constraint-Satisfaction Problems.

[BibT_eX]

[DOI]

Proceedings of the Late-Breaking Developments in the Field of Artificial Intelligence, 2013

2012

Benchmarks for Grid-Based Pathfinding.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Intell. AI Games, 2012

Recap of the Seventh AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE).

[BibT_eX]

[DOI]

AI Mag., 2012

Reports of the AAAI 2012 Conference Workshops.

[BibT_eX]

[DOI]

Artur S. d'Avila Garcez

AI Mag., 2012

Meta-Agent Conflict-Based Search For Optimal Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Moving Path Planning Forward.

[BibT_eX]

[DOI]

Proceedings of the Motion in Games - 5th International Conference, 2012

ArvandHerd: Parallel Planning with a Portfolio.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2012, 2012

Heuristic Search Comes of Age.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

Conflict-Based Search For Optimal Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

Partial-Expansion A* with Selective Node Generation.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

A GGP Feature Learning Algorithm.

[BibT_eX]

[DOI]

Mesut Kirci

Künstliche Intell., 2011

Inconsistent heuristics in theory and practice.

[BibT_eX]

[DOI]

Artif. Intell., 2011

Distance Learning in Agent-Centered Heuristic Search.

[BibT_eX]

[DOI]

Proceedings of the Fourth Annual Symposium on Combinatorial Search, 2011

A Polynomial-Time Algorithm for Non-Optimal Multi-Agent Pathfinding.

[BibT_eX]

[DOI]

Mokhtar M. Khorshid

Robert C. Holte

Proceedings of the Fourth Annual Symposium on Combinatorial Search, 2011

Learning Where You Are Going and from Whence You Came: h- and g-Cost Learning in Real-Time Heuristic Search.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2011, 2011

Keynotes: Data mining and machine learning applications in MMOs.

[BibT_eX]

[DOI]

Greg Ashe

Jong-Hwan Kim

Proceedings of the 2011 IEEE Conference on Computational Intelligence and Games, 2011

A Sparse Grid Representation for Dynamic Three-Dimensional Worlds.

[BibT_eX]

[DOI]

Proceedings of the Seventh AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2011

A Demonstration of ScriptEase II.

[BibT_eX]

[DOI]

Proceedings of the Seventh AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2011

Euclidean Heuristic Optimization.

[BibT_eX]

[DOI]

D. Chris Rayner

Michael H. Bowling

Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

The Compressed Differential Heuristic.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010

Portal-Based True-Distance Heuristics for Path Finding.

[BibT_eX]

[DOI]

Proceedings of the Third Annual Symposium on Combinatorial Search, 2010

Implementing games on pinball machines.

[BibT_eX]

[DOI]

Proceedings of the International Conference on the Foundations of Digital Games, 2010

On learning in agent-centered search.

[BibT_eX]

[DOI]

Yngvi Björnsson

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 20th International Conference on Automated Planning and Scheduling, 2010

A Comparison of High-Level Approaches for Speeding Up Pathfinding.

[BibT_eX]

[DOI]

Robert Geisberger

Proceedings of the Sixth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2010

Understanding the Success of Perfect Information Monte Carlo Sampling in Game Tree Search.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

Single-Frontier Bidirectional Search.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009

Abstraction-Based Heuristics with True Distance Computations.

[BibT_eX]

[DOI]

Proceedings of the Eighth Symposium on Abstraction, Reformulation, and Approximation, 2009

A* Search with Inconsistent Heuristics.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2009, 2009

Memory-Based Heuristics for Explicit State Spaces.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2009, 2009

Evaluating Strategies for Running from the Cops.

[BibT_eX]

[DOI]

Carsten Moldenhauer

Proceedings of the IJCAI 2009, 2009

Improving State Evaluation, Inference, and Search in Trick-Based Card Games.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2009, 2009

TBA*: Time-Bounded A*.

[BibT_eX]

[DOI]

Yngvi Björnsson

Proceedings of the IJCAI 2009, 2009

Learning when to stop thinking and do something!

[BibT_eX]

[DOI]

Proceedings of the 26th Annual International Conference on Machine Learning, 2009

Optimal solutions for moving target search.

[BibT_eX]

[DOI]

Carsten Moldenhauer

Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009

Optimizing Motion-Constrained Pathfinding.

[BibT_eX]

[DOI]

Proceedings of the Fifth Artificial Intelligence and Interactive Digital Entertainment Conference, 2009

2008

An Analysis of UCT in Multi-Player Games.

[BibT_eX]

J. Int. Comput. Games Assoc., 2008

Multidisciplinary students and instructors: a second-year games course.

[BibT_eX]

[DOI]

Proceedings of the 39th SIGCSE Technical Symposium on Computer Science Education, 2008

Optimized algorithms for multi-agent routing.

[BibT_eX]

[DOI]

Akihiro Kishimoto

Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), 2008

A new approach to cooperative pathfinding.

[BibT_eX]

[DOI]

M. Renee Jansen

Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), 2008

Direction Maps for Cooperative Pathfinding.

[BibT_eX]

[DOI]

M. Renee Jansen

Proceedings of the Fourth Artificial Intelligence and Interactive Digital Entertainment Conference, 2008

2007

Graph Abstraction in Real-time Heuristic Search.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2007

An Analysis of Map-Based Abstraction and Refinement.

[BibT_eX]

[DOI]

M. Renee Jansen

Proceedings of the Abstraction, 2007

Memory-Efficient Abstractions for Pathfinding.

[BibT_eX]

[DOI]

Proceedings of the Third Artificial Intelligence and Interactive Digital Entertainment Conference, 2007

Inconsistent Heuristics.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006

Feature Construction for Reinforcement Learning in Hearts.

[BibT_eX]

[DOI]

Adam M. White

Proceedings of the Computers and Games, 5th International Conference, 2006

Robust game play against unknown opponents.

[BibT_eX]

[DOI]

Michael H. Bowling

Proceedings of the 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), 2006

Improving Collaborative Pathfinding Using Map Abstraction.

[BibT_eX]

[DOI]

Michael Buro

Proceedings of the Second Artificial Intelligence and Interactive Digital Entertainment Conference, 2006

Partial Information Endgame Databases.

[BibT_eX]

[DOI]

Yngvi Björnsson

Proceedings of the Advances in Computer Games, 11th International Conference, 2006

Prob-Maxn: Playing N-Player Games with Opponent Models.

[BibT_eX]

[DOI]

Martin Zinkevich

Michael H. Bowling

Proceedings of the Proceedings, 2006

2005

Automatic State Abstraction for Pathfinding in Real-Time Video Games.

[BibT_eX]

[DOI]

Michael Buro

Proceedings of the Abstraction, 2005

Leaf-Value Tables for Pruning Non-Zero-Sum Games.

[BibT_eX]

[DOI]

Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

Partial Pathfinding Using Map Abstraction and Refinement.

[BibT_eX]

[DOI]

Michael Buro

Proceedings of the Proceedings, 2005

Speeding Up Learning in Real-time Search via Automatic State Abstraction.

[BibT_eX]

[DOI]

Maryia Kazakevich

Proceedings of the Proceedings, 2005

2004

Current Challenges in Multi-player Game Search.

[BibT_eX]

[DOI]

Proceedings of the Computers and Games, 4th International Conference, 2004

2003

Last-Branch and Speculative Pruning Algorithms for Max<sup>n</sup>.

[BibT_eX]

[DOI]

Proceedings of the IJCAI-03, 2003

2002

A Comparison of Algorithms for Multi-player Games.

[BibT_eX]

[DOI]

Proceedings of the Computers and Games, Third International Conference, CG 2002, Edmonton, 2002

2000

On Pruning Techniques for Multi-Player Games.

[BibT_eX]

[DOI]