Website founded by
Milan Velimirović
in 2006
16:51 UTC
| |
MatPlus.Net  Forum Fairies Corrections |
| |
|
|
|
|
You can only view this page!
| | | (1) Posted by Joost de Heer [Saturday, Nov 21, 2009 22:18] | Corrections
I found the following in Popeye's BEISPIEL directory (stip.inp):
M. Olausson
2971v, Problemkiste 81, 6/1992, (V: PK-83, 10/1992)
 (= 1+3+1N )
ser-%4 Circe
b)  a4->e8
c)  d7->b2
d) d7->f8
a) and c) are cooked. I found the following correction, has anyone else corrected this composition?
 (= 1+3+1N )
ser-%4 Circe (4.1.1.1)
1.  f7 2. b8= 3. b2(h8) 4. h8%
1. g7 2. b8= 3. b2(h8) 4. h8%
1. b8= 2. d7( c8) 3. b6 4. c8%
1. b8= 2. d6 3. f8 4. f8%
| | | (2) Posted by Joost de Heer [Tuesday, Feb 5, 2013 23:36]; edited by Joost de Heer [13-02-07] |
Not really a correction, but has anyone done 4 rose promotions in promotion-only form more economical than #620 in UiM?
I just found:
 (= 5+4 )
ser-#4
 = Rose, C+ with Popeye
Which saves two pieces
| | | (3) Posted by Kevin Begley [Wednesday, Feb 6, 2013 00:32]; edited by Kevin Begley [13-02-06] |
Such a record may prove easily overcome.
Much depends how you define the specific constraints of this "economical" task -- particularly considering that series-movers do constitute a fairy condition.
For example, Roméo Bédoni showed 6 Rose promotions, in a s#6 with only 10 units, using a pair of fairy conditions.
He also has a problem suggesting that more might be possible, without any fairy condition (simply using a semi-r+2 stipulation -- which can be written such that it requires no condition, while adhering completely to orthodox rules).
| | | (4) Posted by Joost de Heer [Thursday, Feb 7, 2013 08:19] |
Updated the post a little bit to address which economy record I'm asking about.
| |
No more posts |
MatPlus.Net Forum Fairies Corrections |
|
|
|
ISC 2024
