A generalization of the n-queen problem
From MaRDI portal
Publication:3398567
zbMATH Open1246.11005MaRDI QIDQ3398567FDOQ3398567
Authors: Fumio Hazama
Publication date: 29 September 2009
Full work available at URL: http://pphmj.com/abstract/4192.htm
Recommendations
Congruences; primitive roots; residue systems (11A07) Elliptic curves over global fields (11G05) Power residues, reciprocity (11A15)
Cited In (12)
- An upper bound for the minimum number of queens covering the \(n {\times} n\) chessboard
- A $q$-Queens Problem. III. Nonattacking Partial Queens
- Title not available (Why is that?)
- Title not available (Why is that?)
- Partial \(n\)-solutions to the modular \(n\)-queen problem
- Chasing first queens by integer programming
- On the queen domination problem
- Title not available (Why is that?)
- The \(n\)-queens problem in higher dimensions
- The crippled Queen placement problem
- Numerical and Symbolic Studies of the Peaceable Queens Problem
- On the diagonal queens domination problem
This page was built for publication: A generalization of the \(n\)-queen problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3398567)