[Retros] No occupied white square
olli.heimo at luukku.com
Fri Dec 20 10:39:56 EST 2013
Unto Heinonen was really surpised when he heard that Francois had done the task in 10.0 moves. We are eager to see the positions. Meanwhile Unto has thought the theme otherwise. Maximize the number of men left on the board in a sound proofgame ending to the position where all men are on same-coloured squares. Unto has one with 24 men left in 13.0 moves. He will publish it in February-2014 in Tehtäväniekka, unless before that someone breaks his record. Olli.
Noam Elkies kirjoitti 06.12.2013 kello 19:28:
> Francois Labelle <flab at wismuth.com> writes:
> > My computer found a unique proof game in 10.0 moves with 21 men all on
> > white squares, and another unique proof game in 10.0 moves with 21 men
> > all on black squares. A lovely pair of problems! Both are confirmed by
> > Euclide.
> > Looks like this is computer territory. Sorry Unto!
> > Now I'd like to know if Unto is still going to publish his 11.0-move
> > problem in a magazine, and whether I should publish my 2 problems in a
> > magazine...
> I don't see why not. Heinonen's problem was still the first of its kind
> (albeit by only a few days thanks to near-instantaneous global
> and the mechanism is probably different. And you've already
> published some
> of your earlier computer discoveries in problem magazines, so why
> not these?
> P.S. Is it feasible to compute how many such proof games there are in
> 10.5 or even 11.0 and beyond? It would be interesting to see what
> the range of possibilities is (and how much choice Heinonen had for
> his 11.0-mover).
> Retros mailing list
> Retros at janko.at
More information about the Retros