… demonstrates the job-level model by using job-level proof number search to solve some
openings of Connect6 based on a Connect6 program, NCTU6. The proof number search (PNS) …

… PN search to reduce the size of the maintained search tree. This paper proposes a new
approach, named job-level proof-number (JL-PN) search, where the PN search … , and search tree …

… 2.2 Job-Level Parallelization Job-Level Proof Number Search [21] has been used to solve …
The principle is to have a main Proof Number Search tree, but instead of having plain leaves, …

… This node is called the most proving node (MPN). To apply PNS to the generic job-level
search for Connect6, we use the PNS algorithm for the selection and update phases, while the …

… Abstract — An approach called generic job-level (JL) search was proposed to solve computer
… This paper applies JL search to alpha-beta search, and proposes a JL alpha-beta search …

… We describe in detail the implementation of the JL Proof-number Search (JL-PNS) and JL …
In order to further exploit job-level transpositions, we also consider positions that are identical …

… search algorithms are discussed in detail, the job-level Proofnumber search (JL-PNS) algorithm
and the job-level … First, to implement a transposition table for JL search trees, the search …

… This article investigates the use of job-level (JL) algorithms for Connect6 opening book
construction. In the past, JL proof-number search (JL-PNS) was successfully used to solve …

… SPDFPN is a shared-memory parallel version of depth-first proof-number search. It uses
proof and disproof numbers to assign jobs to threads. With a 24 core machine, the hardest 9x9 …

… Phases of job-level search. A critical issue to solve in JL search is avoiding the selection of
… proof/disproof number. The selection query will be recursively called until a leaf is selected. …