Scalable Parallel DFPN Search

DOI10.1007/978-3-319-09165-5_12MaRDI QIDQ2947916zbMATH OpenOpenAlexFDO

Authors Jakub Pawlewicz, Ryan Hayward

Publication date 29 September 2015

Published in Computers and Games (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-09165-5_12

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Experimental studies (91A90) Combinatorial games (91A46)

Recommendations

• Scalable parallel algorithms for FPT problems
• Parallel Depth-First Search in General Directed Graphs
• A note on parallel depth first search
• Parallel depth first search. II: Analysis
• Parallel depth first search. I: Implementation
• A library hierarchy for implementing scalable parallel search algorithms
• Efficient massively parallel methods for dynamic programming
• scientific article; zbMATH DE number 2087981
• Parallel depth-bounded discrepancy search

Cites work

• About the Completeness of Depth-First Proof-Number Search
• Checkers is solved
• Job-level proof-number search for Connect6
• Solving Hex: Beyond Humans

Cited in

(6)

• A winning strategy for 3 n cylindrical Hex
• Conspiracy number search with relative sibling scores
• Towards a scalable and robust DHT
• On the scalability of parallel UCT
• Job-level proof-number search for Connect6
• About the Completeness of Depth-First Proof-Number Search

This page was built for publication: Scalable Parallel DFPN Search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947916)