Chess variant sandbox

This is my vibe-slop project. There are many like it, but this one is mine.
← Proven positions on riders and leapers

Riders and leapers, position 2: find the winning move

White to move. The computer proved a win from here in 5 turns with best play on both sides.

Only one move here is proved to win: find it. Then play the win out against hardest, the strongest computer player.

Positions from the games the computer players played in this game's 4 runs, with 10 pieces or fewer left, from 3 to 20 turns before the end of a game one side won, with the winner to move. The computer searched every move from each, looking at up to 20 million positions, and a position is here only where that search found a forced win for the side to move. Of 110 positions asked it proved 56; 5 it proved lost for the side to move, who won the game played only because the other side then missed its win; it could not settle 49. Proved on 2026-11-01. Checked again on 2026-11-02, on a later version of the computer's engine, by proving 24 of its 61 positions again: every one came out the same. Of the 56 it proved, 48 were left out as too easy: the win was the very next move with more than one way to make it, half the moves or more won, nothing the defender could do put the win off, or a quick look found it: greedy or easy, two of the weakest computer players, played a winning move.

About riders and leapers, and playing it from the start