Domination is a state achieved in chess when all unoccupied squares are threatened by a piece. Its a combinatorics problem that match people like to think about — more can be read about it here

I ended up just brute forcing the problem which is like wrong but it ended up being kinda cool to see just how many iterations it takes. I ended up just having it run on a second monitor for a day or so to see how close to the optimal solution it could get.

##### King Domination:

Optimal solution found: **Yes**. Iterations required: **10,279,903**

##### Queen Domination:

Optimal solution found: **Yes**. Iterations required: **1661**

##### Bishop Domination:

Optimal solution found: **Yes**. Iterations required: **125,315**

##### Rook Domination:

Optimal solution found: **Yes**. Iterations required: **104**

##### Knight Domination:

Optimal solution found: **No**. Iterations done: **about 22 million**. Actual answer: **17**

Link to the github code here. Written in Python 3.5