Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Mathematical approach for N-Queens problem with isomorphism

From MaRDI portal
Publication:5226771
Jump to:navigation, search

zbMATH Open1438.90286MaRDI QIDQ5226771FDOQ5226771


Authors: Sanjay Jain, Chander Shakher Edit this on Wikidata


Publication date: 1 August 2019


Full work available at URL: https://camo.ici.ro/journal/vol19/v19b11.pdf




Recommendations

  • A maximum flow algorithm to locate non-attacking queens of an \(n\times n\) chessboard
  • scientific article; zbMATH DE number 2140326
  • A group-based search for solutions of the \(n\)-queens problem
  • A bit computing algorithm for the \(N\)-queens problem
  • Solving the \(N\)-Queens problem using hyperbrid genetic algorithm


zbMATH Keywords

transformationisomorphismnon-isomorphic solutionsN-Queens


Mathematics Subject Classification ID

Combinatorial optimization (90C27)



Cited In (3)

  • Linear congruence equations for the solutions of the \(N\)-queens problem
  • A maximum flow algorithm to locate non-attacking queens of an \(n\times n\) chessboard
  • Numerical and Symbolic Studies of the Peaceable Queens Problem





This page was built for publication: Mathematical approach for N-Queens problem with isomorphism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5226771)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5226771&oldid=19836913"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 18:12. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki