The n-Queens Problem - Maple Application Center

The n-Queens Problem - Maple Application Center

Wenden Sie sich an Maplesoft Preisangebot anfordern

Submit your work

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

Share

Copy URL

This app is not in any Collections

More Like This

Interactive Sudoku

Solving the World's Hardest Sudoku

Fuzzy Sets in Examples

Prof. Gennady P. Chuiko

Pascal's triangle and its relationship to the Fibonacci sequence

Maplesoft Author Maplesoft

Solving the Einstein Riddle

Solving constraint satisfaction problems II: More difficult logic problems

Clique Finding with SAT

Finding Minimal Sum for Boolean Expression

Finding Graeco-Latin Squares

Solving constraint satisfaction problems I: Logic problems

Prime Implicants of Boolean Expression by Concensus method

Polynomizing Lukasiewicz's Many-Valued Logics by Maple

Kahtan H. Alzubaidy