Jacobi equipped with constraints… (Michel Caillaud, Nicolas Dupont, François Labelle)

Jacobi: constraints

An article by Michel Caillaud, Nicolas Dupont, François Labelle explains and illustrates a new tool to solve some complicated fairy PGs offered by the solving program Jacobi – the possibility to add some constraints in the input.
(with gratitude to the authors for offering this article to JF)

…Jacobi constraints let the user specify some or all of a piece’s moves. One design goal was to be able to represent the “strategy” notation displayed by Natch and Euclide when solving a proof game, so the notation is somewhat similar. This common notation includes the “-” and “x” symbols, and a minimum number n of moves played by a piece is marked “(n)”…


Bookmark the permalink.

One Response to Jacobi equipped with constraints… (Michel Caillaud, Nicolas Dupont, François Labelle)

  1. Kostas Prentos says:

    Great work! Until recently, we knew Jacobi to be the only practical choice for testing fairy proof games. With the constraints option, Jacobi can be useful for testing orthodox PGs that can beat Natch or Euclide.

Leave a Reply

Your email address will not be published. Required fields are marked *

You can add images to your comment by clicking here.