MatPlus.Net

 Website founded by
Milan Velimirović
in 2006

9:00 UTC
ISC 2024
 
  Forum*
 
 
 
 

Username:

Password:

Remember me

 
Forgot your
password?
Click here!
SIGN IN
to create your account if you don't already have one.
CHESS
SOLVING

Tournaments
Rating lists
1-Jan-2024

B P C F





 
 
MatPlus.Net Forum Promenade Problem with largest number of different fairy pieces and/or conditions?
 
You can only view this page!
Page: [Previous] [Next] 1 2
(21) Posted by Cornel Pacurar [Sunday, Jul 18, 2010 23:05]

@ seetharaman: Indeed, a 1,5-leaper on certain available squares (i.e. not a8!) allows for a 13th promotion and solution.
 
 
(Read Only)pid=5633
(22) Posted by Vlaicu Crisan [Tuesday, Jul 20, 2010 18:55]

@Cornel: I think you got the point. :-) Using fairy constraints such as "sibling capture only" might increase the number of promotions, but the task will be rather artificially done.
OK, to make the proposal more interesting / challenging / open: can anyone improve Ueda's fairy promotions tasks (e.g. like those displayed in this thread and in the MPR article)?
I would like to prepare some originals in my fairy column from Problem Paradise with Western problemists' reactions to Yoshikazu Ueda's compositions.
 
   
(Read Only)pid=5652
(23) Posted by seetharaman kalyan [Tuesday, Jul 20, 2010 19:25]; edited by seetharaman kalyan [10-07-20]

I have already suggested an improvement to the 12 promotion problem in my earlier thread. Add a 1,5 Leaper at g1 for a thirteenth solution. You are welcome to use it.
 
 
(Read Only)pid=5653

No more posts
Page: [Previous] [Next] 1 2

MatPlus.Net Forum Promenade Problem with largest number of different fairy pieces and/or conditions?