No captures, try to get all the pieces into one connected group. You move using the move of one of your neighbours. Pieces without neighbours can't move.
Start by randomly generating a layout. Maybe a deck of red and black cards from 2 to 6, red shifts files and black shifts ranks. Another deck of red and black piece types, choosing which pieces to drop, excluding pawns. If you land on an occupied square, you may choose any empty square in the surrounding 8.
You decide when to stop. One point for every unused piece.
Diagonal connections count. Only get moves from neighbours of the same colour.
[x] Add rules.
[ ] Add some examples.
[ ] Generate interesting problems to solve.
[ ] Simulate a bunch of games, and give quartile scores as targets.
No captures, try to get all the pieces into one connected group. You move using the move of one of your neighbours. Pieces without neighbours can't move.
Start by randomly generating a layout. Maybe a deck of red and black cards from 2 to 6, red shifts files and black shifts ranks. Another deck of red and black piece types, choosing which pieces to drop, excluding pawns. If you land on an occupied square, you may choose any empty square in the surrounding 8.
You decide when to stop. One point for every unused piece.
Diagonal connections count. Only get moves from neighbours of the same colour.