Place N queens on a NxN chess board so that none of them attack the other.
A generalised form of the 8 queens problem of placing 8 queens on a chess board.
Play from levels 1 to 10 placing 4 to 13 queens! Can you do it in the minimum possible moves? Give it a shot!
熱門國家 | 系統支援 | 版本 | 費用 | APP評分 | 上架日期 | 更新日期 |
---|---|---|---|---|---|---|
未知 | Android Google Play | 1.0.1 App下載 | 免費 | 1970-01-01 | 2015-04-21 |