# [Retros] No occupied white square

**Kevin Begley**
kevinjbegley at gmail.com

*Fri Dec 20 16:56:56 EST 2013*

Olli,

I presume that this "record" must be defined for n-units (from 2 to 32), in

the shortest number of moves. You could further divide this into two

square-colors.

The point is, he should probably publish, regardless (unless somebody

achieves n (or more) units on the same color, in fewer moves).

The most important of these records, it seems to me, are;

1) Fastest to the result (for any square-color), and

2) Most units total (in the fastest time, for any square-color).

Best,

Kevin

On Fri, Dec 20, 2013 at 7:39 AM, Olli Heimo <olli.heimo at luukku.com> wrote:

>* 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
*

>* > communication);
*

>* > and the mechanism is probably different. And you've already
*

>* > published some
*

>* > of your earlier computer discoveries in problem magazines, so why
*

>* > not these?
*

>* >
*

>* > NDE
*

>* >
*

>* > 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
*

>* > http://www.pairlist.net/mailman/listinfo/retros
*

>*
*

>* _______________________________________________
*

>* Retros mailing list
*

>* Retros at janko.at
*

>* http://www.pairlist.net/mailman/listinfo/retros
*

>*
*

>*
*

-------------- next part --------------

An HTML attachment was scrubbed...

URL: <http://www.pairlist.net/pipermail/retros/attachments/20131220/acf8598b/attachment.htm>

More information about the Retros
mailing list