daStrwbrry wrote:
Is there a name for this idea where the knight visits every knight square?
I don’t think there is a name for this [...]
I suppose it could also be a very literal knight's tour.
Shortest-proof-game challenge
Sort:
@6726
EvinSung wrote:
#6726
Unique SPG in 14.5. The knight swap is needed.
Ignore the above post, it isn’t unique: Ng8 has multiple ways to g1.
Here is EvinSung’s edited position.
daStrwbrry wrote:
Ignore the above post, it isn’t unique: Ng8 has multiple ways to g1.
Here is EvinSung’s edited position.
Gotta love chess.com's unlimited edit policy.
Leaves solvers spinning their wheels, trying to hit a moving target.
The end lesson is not to engage posts so quickly. Just what any healthy forum needs.
Leither123 wrote:
#6731
13.0
Leither123 wrote:
#6733
14.0
@6736
First try:
EvinSung wrote:
#6736
Unique SPG in 14.5.
Two questions:
1. Is this position's SPG unique?
2. For what other move count does the position have a unique proof game?
n9531l1 wrote:
Two questions:
1. Is this position's SPG unique?
2. For what other move count does the position have a unique proof game?
1. Yes
Please don't use computers. I did a test already. It's sound.
Hardly original, but seems to be the shortest possible problem of this theme.
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.