This is my first Chess Puzzle!
- Let suppose you start a Chess game.
- Whites' aim will be to place all their alive pieces on white squares in a minimum of moves and black will do the same, but with black squares.
- Both players can (and should) eat other pieces and all normal chess rules are maintained (check, en passant, castle and so on). except that reaching all the white (or black) squares is infinitely more important than checkmate.
- Both Whites and Blacks made peace and are in a collaborative game :) They both try to minimize the number of moves.
What is the minimum number of moves you can make?
- Prove this is the minimum.
- Is this minimum the same if we permute black and white squares: Whites capture black squares and Blacks capture white squares?
I've made a very quick attempt that will give you a maximum bound of such an optimal game, with $14$ Whites moves: