|
|
| (1) Posted by Eugene Rosner [Friday, Apr 1, 2016 23:15] |
working on a problem with maximummer-an important question...
I'm examining a maxi move with take&makechess(non-wcct related!). as you know a complete move involves a capture and then an additional move. consider 1...bSa1xwRb3-b1. Is the overall length of the combined move 1 or sqrt(5)+2? (starting sq to ending aq OR adding both vectors)?
|
|
| (2) Posted by seetharaman kalyan [Saturday, Apr 2, 2016 09:36] |
Similar question can arise in moves of pieces like double grasshoppers. Is the total move length to be considered or the distance from starting to ending square. I think the second option is correct.
|
|
| (3) Posted by shankar ram [Saturday, Apr 2, 2016 16:18] |
I second the second option too!
But need to see how winchloe and popeye treat it...
|
|
| (4) Posted by Torsten Linß [Saturday, Apr 2, 2016 16:34] |
As far as I remember Popeye takes the euclidean distance between departure and arrival squares.
|
|
| (5) Posted by Geoff Foster [Saturday, Apr 2, 2016 23:57] |
It is easy to check. Consider a position with wPc3 and bSd4. To find the longest move use the following Popeye code:
stipulation h~0.5
pieces white pc3 black sd4
condition WhiteMaximummer Take&Make
"h~" is "help anymove". Note that European users will need to use a comma, as follows: "h~0,5".
If the total move length is used then all 8 moves would be returned. However Popeye gives the following, which are the two moves with the longest distance from starting to end square:
1...c3*d4-f5
1...c3*d4-e6
|
|
No more posts |
MatPlus.Net  Forum General working on a problem with maximummer-an important question... |
ISC 2024
