The n-Queens Problem - Maple Application Center
Application Center Applications The n-Queens Problem

The n-Queens Problem

Author
: Curtis Bright
Engineering software solutions from Maplesoft
This Application runs in Maple. Don't have Maple? No problem!
 Try Maple free for 15 days!
The n-Queens problem is to place n queens on an n by n chessboard such that no two queens are mutually attacking. We can use Maple's built-in efficient SAT solver to quickly solve this problem.

Application Details

Publish Date: October 04, 2018
Created In: Maple 2018
Language: English

More Like This

Pascal's triangle and its relationship to the Fibonacci sequence
Solving constraint satisfaction problems II: More difficult logic problems
Solving the World's Hardest Sudoku
Finding Minimal Sum for Boolean Expression
Polynomizing Lukasiewicz's Many-Valued Logics by Maple
Prime Implicants of Boolean Expression by Concensus method
Solving constraint satisfaction problems I: Logic problems
Introduction to Fuzzy Controllers
Logic and truth tables
Solving the Einstein Riddle