Martin Schijf's research initially dealt with the application of Proof-number search to Nine Men’s Morris, when it became evident that many equal positions were analyzed more than once due to transpositions and cycles. He describes how PNS can be applied in three different search structures, in trees, directed acyclic graphs, and even directed cyclic graphs[3].
a Dutch computer scientist and project manager with a M.Sc. in 1993 from Leiden University. Along with Victor Allis and Jos Uiterwijk, he worked on the topic of transpositions in Proof-number search [1].
Table of Contents
PNS and Transpositions
Martin Schijf's research initially dealt with the application of Proof-number search to Nine Men’s Morris, when it became evident that many equal positions were analyzed more than once due to transpositions and cycles. He describes how PNS can be applied in three different search structures, in trees, directed acyclic graphs, and even directed cyclic graphs [3].Selected Publications
[4]External Links
References
What links here?
Up one level