The depth first proof number search (df-pn) is an effective and popular algorithm for solving and-or tree problems by using proof and disproof numbers. This paper presents a sim-ple but effective parallelization of the df-pn search algorithm for a shared-memory system. In this parallelization, multiple agents autonomously conduct the df-pn with a shared trans-position table. For effective cooperation of agents, virtual proof and disproof numbers are introduced for each node, which is an estimation of future proof and disproof numbers by using the number of agents working on the node’s descen-dants as a possible increase. Experimental results on large checkmate problems in shogi, which is a popular chess vari-ant in Japan, show that reasonab...
Proof-number search (pns) is a powerful method for solving games and game positions. Over the years,...
Proof-number search (pns) is a powerful method for solving games and game positions. Over the years,...
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. ...
The depth first proof number search (df-pn) is an effective and popular algorithm for solving and-or...
Abstract. We present Scalable Parallel Depth-First Proof Number Search, a new shared-memory parallel...
Abstract. We present Scalable Parallel Depth-First Proof Number Search, a new shared-memory parallel...
Depth-first proof-number search (df-pn) is a powerful variant of proof-number search algorithms, wid...
Depth-first proof-number search (df-pn) is a powerful variant of proof-number search algorithms, wid...
Proof-number (pn) search is a best-first adversarial search algorithm especially suited for finding ...
Proof-number (pn) search is a best-first adversarial search algorithm especially suited for finding ...
Proof-number (pn) search is a best-first adversarial search algorithm especially suited for finding ...
Proof-number (pn) search is a best-first adversarial search algorithm especially suited for finding ...
Proof-number (pn) search is a best-first adversarial search algorithm especially suited for finding ...
Abstract. Proof-Number Search (PNS) is a powerful method for solv-ing games and game positions. Over...
Proof-number search (pns) is a powerful method for solving games and game positions. Over the years,...
Proof-number search (pns) is a powerful method for solving games and game positions. Over the years,...
Proof-number search (pns) is a powerful method for solving games and game positions. Over the years,...
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. ...
The depth first proof number search (df-pn) is an effective and popular algorithm for solving and-or...
Abstract. We present Scalable Parallel Depth-First Proof Number Search, a new shared-memory parallel...
Abstract. We present Scalable Parallel Depth-First Proof Number Search, a new shared-memory parallel...
Depth-first proof-number search (df-pn) is a powerful variant of proof-number search algorithms, wid...
Depth-first proof-number search (df-pn) is a powerful variant of proof-number search algorithms, wid...
Proof-number (pn) search is a best-first adversarial search algorithm especially suited for finding ...
Proof-number (pn) search is a best-first adversarial search algorithm especially suited for finding ...
Proof-number (pn) search is a best-first adversarial search algorithm especially suited for finding ...
Proof-number (pn) search is a best-first adversarial search algorithm especially suited for finding ...
Proof-number (pn) search is a best-first adversarial search algorithm especially suited for finding ...
Abstract. Proof-Number Search (PNS) is a powerful method for solv-ing games and game positions. Over...
Proof-number search (pns) is a powerful method for solving games and game positions. Over the years,...
Proof-number search (pns) is a powerful method for solving games and game positions. Over the years,...
Proof-number search (pns) is a powerful method for solving games and game positions. Over the years,...
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. ...