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

von Sturtevant, Nathan R.
Veröffentlicht in Computers and Games Conference (11. : 2022 : Online) Computers and games (2023)

On Strongly Solving Chinese Checkers

von Sturtevant, Nathan R.
Veröffentlicht in Advances in Computer Games Conference (16. : 2019 : Macau) Advances in computer games (2020)

Benchmarks for Pathfinding in 3D Voxel Space

von Brewer, Daniel
Veröffentlicht in International Symposium on Combinatorial Search (11. : 2018 : Stockholm) Proceedings of the Eleventh International Symposium on Combinatorial Search (SoCS 2018) (2018)

AVOIDING RE-EXPANSIONS IN SUBOPTIMAL BEST-FIRST SEARCH

von Chen, Jingwei
Veröffentlicht in International Symposium on Combinatorial Search (14. : 2021 : Online) 14th International Symposium on Combinatorial Search (SoCS 2021) (2021)

Unbounded Sub-Optimal Conflict-Based Search in Complex Domains

von Walker, Thayne T.
Veröffentlicht in International Symposium on Combinatorial Search (12. : 2019 : Napa, Calif.) Proceedings of the Twelfth International Symposium on Combinatorial Search (SoCS 2019) (2019)

Pathfinding and Abstraction with Dynamic Terrain Costs

von Sturtevant, Nathan R.
Veröffentlicht in AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (15. : 2019 : Atlanta, Ga.) Proceedings, the Fifteenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (2019)

Revisiting Suboptimal Search

von Chen, Jingwei
Veröffentlicht in International Symposium on Combinatorial Search (12. : 2019 : Napa, Calif.) Proceedings of the Twelfth International Symposium on Combinatorial Search (SoCS 2019) (2019)

THE UNEXPECTED CONSEQUENCE OF INCREMENTAL DESIGN CHANGES

von Sturtevant, Nathan R.
Veröffentlicht in AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (16. : 2020 : Online) Sixteenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE-20) (2021)

Predicting the Effectiveness of Bidirectional Heuristic Search

von Sturtevant, Nathan R.
Veröffentlicht in ICAPS Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling (2020)

ITERATIVE-DEEPENING BIDIRECTIONAL HEURISTIC SEARCH WITH RESTRICTED MEMORY

von Shperberg, Shahaf S.
Veröffentlicht in International Symposium on Combinatorial Search (14. : 2021 : Online) 14th International Symposium on Combinatorial Search (SoCS 2021) (2021)

ITERATIVE-DEEPENING BIDIRECTIONAL HEURISTIC SEARCH WITH RESTRICTED MEMORY

von Shperberg, Shahaf S.
Veröffentlicht in International Conference on Automated Planning and Scheduling (31. : 2021 : Online) Thirty-first International Conference on Automated Planning and Scheduling (ICAPS 2021) (2021)

Minimizing Node Expansions in Bidirectional Search with Consistent Heuristics

von Shaham, Eshed
Veröffentlicht in International Symposium on Combinatorial Search (11. : 2018 : Stockholm) Proceedings of the Eleventh International Symposium on Combinatorial Search (SoCS 2018) (2018)

Probabilistic Robust Multi-Agent Path Finding

von Atzmon, Dor
Veröffentlicht in ICAPS Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling (2020)

A DEMONSTRATION OF ANHINGA: A MIXED-INITIATIVE EPCG TOOL FOR SNAKEBIRD

von Sturtevant, Nathan R.
Veröffentlicht in AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (16. : 2020 : Online) Sixteenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE-20) (2021)

W-restrained Bidirectional Bounded-Suboptimal Heuristic Search

von Atzmon, Dor
Veröffentlicht in International Conference on Automated Planning and Scheduling (33. : 2023 : Prag) Thirty-third International Conference on Automated Planning and Scheduling (ICAPS 2023) (2023)

improving Bidirectional Heuristic Search by Bounds Propagation

von Shperberg, Shahaf S.
Veröffentlicht in International Symposium on Combinatorial Search (12. : 2019 : Napa, Calif.) Proceedings of the Twelfth International Symposium on Combinatorial Search (SoCS 2019) (2019)

JUMP POINT SEARCH WITH TEMPORAL OBSTACLES

von Hu, Shuli
Veröffentlicht in International Conference on Automated Planning and Scheduling (31. : 2021 : Online) Thirty-first International Conference on Automated Planning and Scheduling (ICAPS 2021) (2021)

Enriching Non-Parametric Bidirectional Search Algorithms - Extended Abstract

von Shperberg, Shahaf S.
Veröffentlicht in International Symposium on Combinatorial Search (12. : 2019 : Napa, Calif.) Proceedings of the Twelfth International Symposium on Combinatorial Search (SoCS 2019) (2019)

CONFLICT-BASED INCREASING COST SEARCH

von Walker, Thayne T.
Veröffentlicht in International Conference on Automated Planning and Scheduling (31. : 2021 : Online) Thirty-first International Conference on Automated Planning and Scheduling (ICAPS 2021) (2021)

Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks

von Stern, Roni
Veröffentlicht in International Symposium on Combinatorial Search (12. : 2019 : Napa, Calif.) Proceedings of the Twelfth International Symposium on Combinatorial Search (SoCS 2019) (2019)