Chess variant sandbox

This is my vibe-slop project. There are many like it, but this one is mine.
← Proven positions on short sweeping bishop chess

Short sweeping bishop chess, position 1: find the winning move

Black to move. The computer proved a win from here in 7 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 6 pieces or fewer left, from 3 to 12 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 222 positions asked it proved 159; it could not settle 63. Proved on 2026-10-31. Checked again on 2026-11-02, on a later version of the computer's engine, by proving 20 of its 159 positions again: every one came out the same. Of the 159 it proved, 152 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. 3 more were set aside: nothing in them, from the pieces on the board to the moves of the win, is anything this game has that chess does not.

About short sweeping bishop chess, and playing it from the start