Hacker News Reader

edit: since I'm continuing to get down-votes despite two separate retractions below: I already agreed I was wrong. Not like I can delete the comment.

Original comment below.

This is the "N queens problem", a classic that predates both the internet and LinkedIn. Renaming and attributing it as "LinkedIn Queens" in this article is distracting.

View on HN

It's not "N-Queens". It's "Star Battle": https://www.puzzle-star-battle.com/.

I see now, thank you!

"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.

Reply on news.ycombinator.com