Chess variant sandbox

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

Proven positions on short sweeping bishop chess

4 positions from this game that the computer proved won for the side to move, to play out against hardest, or to find the one move that wins. There is no clock, and nothing here expires.

Wins in 7 turns

  1. Position 1: Black to move, one winning move
  2. Position 2: Black to move, one winning move
  3. Position 3: Black to move, one winning move
  4. Position 4: Black to move, one winning move

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.