daStrwbrry wrote:
The 33.0 PG is cooked. That Rg8-g1-a1 cook works.
It doesn’t work with the 32.5 PG (with Ng2 —> e3) though, so it might be unique. Maybe.
Unique SPG in 32.5. (Stelvio 2.1, Solving time: 5:11:18 hours)
Shortest-proof-game challenge
Sort:
BishopTakesH7 wrote:
#6707
Non-unique SPG in 12.0.
switchback, but also literally
Apr 2, 2024
0
#6706
I'd like someone other than @n9531l1 to post the solution to this one.
Apr 2, 2024
0
#6707
Leither123 wrote:
switchback, but also literally
Unique 10.5 move solution.
BishopTakesH7 wrote:
I'd like someone other than @n9531l1 to post the solution to this one.
Well, I was going to post a solution, but the problem keeps changing before I can.
So I'll move on instead.
Apr 2, 2024
0
#6709
BigDoggProblem wrote:
BishopTakesH7 wrote:
I'd like someone other than @n9531l1 to post the solution to this one.
Well, I was going to post a solution, but the problem keeps changing before I can.
That's my bad; I extended it.
BishopTakesH7 wrote:
I'd like someone other than @n9531l1 to post the solution to this one.
This was a fun proof game to solve. 13.0
daStrwbrry wrote:
#6715
Unique SPG in 9.0.
EvinSung wrote:
#6717
SPGs in 14.0.
Apr 3, 2024
0
#6715
daStrwbrry wrote:
BishopTakesH7 wrote:
I'd like someone other than @n9531l1 to post the solution to this one.
This was a fun proof game to solve. 13.0
Is there a name for this idea where the knight visits every knight square?
How about a simple one for a change? How fast can this position occur (with black to move since it's stalemate).
EndgameEnthusiast2357 wrote:
How about a simple one for a change? How fast can this position occur (with black to move since it's stalemate). (#6720)
Here's my first try, 23.5 moves.
Now of course we have to do the reverse, to make it end in an even full number of moves!
EndgameEnthusiast2357 wrote:
Now of course we have to do the reverse, to make it end in an even full number of moves!
I'll leave that one for those who feel that they have to do it.
BishopTakesH7 wrote:
daStrwbrry wrote:
BishopTakesH7 wrote:
I'd like someone other than @n9531l1 to post the solution to this one.
This was a fun proof game to solve. 13.0
Is there a name for this idea where the knight visits every knight square?
I don’t think there is a name for this, although this is a very nice idea I didn’t realise! The b1 knight does end up on g1 though, so it is considered an impostor knight. However, the knight doesn’t need to visit b8 or g8 to be an impostor: it just needs to end up on the home square of the other knight.
I was hoping the white queen couldn't go on the back rank