A documentation of the Peaceable Armies of Queens problem — placing N black and N white chess queens on a D×D board such that no queen can attack a queen of the other color. Solved using constraint programming in SICStus Prolog.