[ View Thread ] [ Post Response ] [ Return to Index ] [ Read Prev Msg ] [ Read Next Msg ]

BGonline.org Forums

flawed measure of complexity

Posted By: Timothy Chow
Date: Friday, 7 May 2010, at 6:20 p.m.

In Response To: flawed measure of complexity (Nack Ballard)

You might be thinking of Shinkman's problem. The eight-knight underpromotion is not the only way to win, but it is the fastest.

For those who want to see more of this kind of thing, I recommend Jeremy Morse's book Chess Problems: Tasks and Records.

Stick's problem of getting twenty knights in the minimum number of moves might appeal to chess problem composers, but I think it would need to be phrased as follows to generate serious interest: Construct a sound proof game with as many knights as possible on the board. A "sound proof game" is a position, together with a number N of moves, with the property that there is only one way to achieve the given position after exactly N moves. (In other words, there are no transpositions or alternate routes that arrive at the same position after N moves.)

Messages In This Thread

 

Post Response
Your Name:
Your E-Mail Address:
Subject:
Message:

If necessary, enter your password below:

Password:
 

 

[ View Thread ] [ Post Response ] [ Return to Index ] [ Read Prev Msg ] [ Read Next Msg ]

BGonline.org Forums is maintained by Stick with WebBBS 5.12.