Home * People * Patrick Schoo

Patrick Schoo,
a Dutch computer scientist, and early endgame database researcher. He already made his project thesis on that topic at The Hague University of Applied Sciences in 1988, and continued his studies while affiliated with the University of Limburg [1], where he also worked with Victor Allis to solve Qubic applying Proof-number search [2] [3].

Confirming Troitsky

Co-authored by Bob Herschberg and Jaap van den Herik at the WCCC 1989 Workshop New Directions in Game-Tree Search, Schoo elaborated on verifying and codifying strategies of the five piece endgame of two knights versus rook pawn KNNKP(h) [4]. During the generation of appropriate tablebases complete knowledge is obtained by an exhaustive enumeration via full-width backward chaining [5], also dubbed retrograde analysis. Schoo et al. confirmed two statements of Alexey Troitsky [6], statement A, that the position is always a win for White provided the pawn no further down than the Troitsky line (h4-h7) is safely blocked by a knight, and statement B, for the blocked pawn on h3, that the game is drawn whenever the black king is within the Troitsky zone.
 Troitsky line        Troitsky zone
 
 . . . . . . . .      1 1 1 1 . . . .
 . . . . . . . .      1 1 1 1 1 . . .
 . 1 . . . . 1 .      1 1 1 1 1 1 . .
 . . 1 . . 1 . .      . 1 1 1 1 1 . .
 1 . . 1 1 . . 1      . . 1 1 1 1 . .
 . . . . . . . .      . . . . . . . p
 . . . . . . . .      . . . . . . . N
 . . . . . . . .      . . . . . . . .

Selected Publications

[7]

References

  1. ^ mapsrc/u.nld.4
  2. ^ Victor Allis, Patrick Schoo (1992). Qubic Solved Again. Heuristic Programming in Artificial Intelligence 3: The Third Computer Olympiad
  3. ^ Victor Allis (1994). Searching for Solutions in Games and Artificial Intelligence. Ph.D. Thesis, University of Limburg, pdf
  4. ^ Bob Herschberg, Jaap van den Herik, Patrick Schoo (1989). Verifying and Codifying Strategies in the KNNKP(h) Endgame. ICCA Journal, Vol. 12, No. 3, pdf
  5. ^ Jaap van den Herik, Bob Herschberg (1985). The Construction of an Omniscient Endgame Data Base. ICCA Journal, Vol. 8, No. 2
  6. ^ Alexey Troitsky (1934). Collection of chess problems. OGIZ Physical Culture and Tourism, Leningrad (Сборник шахматных этюдов. ОГИЗ Физкультура и туризм, Ленинград), partly republished (1937). Collection of chess problems: With a Supplement on the Theory of the End-Game of Two Knight against Pawns. translated by A.D. Pritzson
  7. ^ ICGA Reference Database(pdf)
  8. ^ Tony Marsland (1990). A Short History of Computer Chess. Computers, Chess, and Cognition, pdf with Preface and Foreword

What links here?


Up one level