[Retros] Proof games with loss of tempo

[Joost de Heer]

On Mon, March 19, 2012 06:44, Francois Labelle wrote:

> For each value of t, what is the smallest n with a PG that has

> a) a unique solution in n moves and some solution(s) in n - t moves?

> b) a unique solution in both n and n - t moves?

>



> t=3.5 ?


Michel did this in 2000:
http://www.softdecc.com/pdb/search.pdb?expression=PROBID='P1000618'

Joost