﻿﻿ MatPlus.Net

Website founded by
Milan Velimirović
in 2006

4:55 UTC
 ISC 2022
 Headlines Forum* Fellows Members DL Archive Links

Username:

Password:

Remember me

 Forgot yourpassword?Click here! SIGN INto create your account if you don't already have one.
 CHESS SOLVINGTournamentsRating lists1-Apr-2022
 B P C F

MatPlus.Net Forum Fairies Corrections

You can only view this page!

### 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%

 (Read Only) pid=4374

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

 (Read Only) pid=9733

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).

 (Read Only) pid=9734

Updated the post a little bit to address which economy record I'm asking about.

 (Read Only) pid=9745

No more posts

MatPlus.Net Forum Fairies Corrections