﻿﻿ MatPlus.Net

Website founded by
Milan Velimirović
in 2006

17:38 UTC
 ISC 2020

Remember me

 CHESS SOLVINGTournamentsRating lists1-Oct-2020
 B P C F

MatPlus.Net Forum General Longest problems with all moves on the same color?

### Longest problems with all moves on the same color?

I've had this question for a long time now, probably a year if not months, but only now am I remembering it. What are the longest problems in which both sides move on only one color of the chessboard? Of course, units may stand on either color at start, but only half is used in the solution. I wish for helpmates, seriesmovers, selfmates, directmates, etc, and all in between.

For selfmates, I made this half-paltry attempt. Call it a scheme if horribly cooked, instead of an actual problem. :) (weasels away in slashed captions)

s#17.
(= 14+10 )

1. Bxg4 Bh7 2. Bc8 Bg8 3. Kg4 Bh7 4. Kh3 Bg8 5. Kg2 Bh7 6. Kf1 Bg8 7. Ke2 Bh7 8. Kd1 Bg8 9. Kc2 Bh7 10. Kb3 Bg8 11. Ka4 Bh7 12. Kb5 Bg8 13. Kc6 Bh7 14. Kd7 Bg8 15. Ke8 Bh7 16. Bd7 Bg8 17. Qxf7+ Bxf7#

My general inspiration was a game in which Kasparov made 18 consecutive moves on the light squares!-https://www.chessgames.com/perl/chessgame?gid=1067168

Done in five seconds, and thus not checked at all :-)
(OK, checked insofar White can switch moves around)

(= 8+9 )

White hser=27 ...13.Bd4...27.Ke5 Kxg3=

Which immediately raises the question: may I put
the bK to h3, gaining 2 moves with Bh2, i.e. it's OK if
a piece switches field color?

Hauke, how do you determine the order of white moves after 4.Ba3?

I don't - I know it's incorrect, it was just a demo :-)

It's a ser-h=27.
Gustav gives 117935 solutions.
Someone able to find a formula?

Here are last moves and number of solutions:

13 . 1
14 . 1
15 . 14
16 . 104
17 . 539
18 . 2157
19 . 7064
20 . 19663
21 . 44357
22 . 81146
23 . 117935
24 . 117935
25 . 117935
26 . 117935
27 . 117935

You want a formula how incorrect it is? :-)
Well, the K must stay behind the B, so
I expect the Catalan numbers to be involved.

Can probably be extended.
(= 10+9 )

SPG10.5, Monochrome

Thought that somebody remembers this one but in vain...

AT
Schach-Echo 1977
Special Prize
(= 5+9 )

Ser-h#80
Double Maximummer

1. Kc7 2. Lb6 3. La5 4. Lb4 5. Kd8 6. Ke7 7. Kf8 8. Kg7 9. Kh6 10. Kg5 11. Kh4 12. Kg3 13. Kf2 14. Ke1 15. Kd2 16. Kc1 17. La3 18. Lb2 19. La1 20. Kb2 21. Ka3 22. Lb2 23. Lc1 24. Ld2 25. Kb4 26. Ka5 27. Kb6 28. Kc7 29. Kd8 30. Ke7 31. Kf8 32. Kg7 33. Kh6 34. Kg5 35. Kh4 36. Kg3 37. Le1 38. Lf2 39. Lg1 40. Lxh2 41. Lg1 42. Lf2 43. Le1 44. Ld2 45. Kh4 46. Kg5 47. Kh6 48. Kg7 49. Kf8 50. Ke7 51. Kd8 52. Kc7 53. Kb6 54. Ka5 55. Kb4 56. Ka3 57. Lc1 58. Lb2 59. La1 60. Kb2 61. Kc1 62. Lb2 63. La3 64. Lb4 65. Kd2 66. Ke1 67. Kf2 68. Kg3 69. Kh4 70. Kg5 71. Kh6 72. Kg7 73. Kf8 74. Ke7 75. Kd8 76. Kc7 77. La5 78. Lb6 79. La7 80. Kb8 Lxd6#

Can be easily extended for over 130 (series-)moves...

(9) Posted by Siegfried Hornecker [Monday, Nov 16, 2020 09:35]

I would love to see a matrix like that where the goal is to prevent a "threefold repetition" in forward play with a stipulation of ser-h# in exactly X. (So the king and bishop would need to go around the board multiple times so no position is repeated twice, i.e. three times on the board). As it is a seriesmover, I believe that the implication that Black is forced to make x moves before White can play is not "too fairy" about it.
That might be interesting.