Comment by vidarh
"LinkedIn Queens" is different from the classic n-queens problem, in that the queens do not threaten each other diagonally other than immediately adjacent, and secondly each board is split into not just rows and columns, but also colors and only 1 queen can be placed on each row, column, and color.
And these colored regions can be of any size.
Thank you for correcting me, I see the distinction now.