The top documents tagged [nqueens problem]

Backtracking

Lecture 1: Constraint networks overview

Scala byexample[1]

Scala byexample

1 Search Problems CSD 15-780:Graduate Artificial Intelligence Instructors:Zico Kolter and Zack Rubinstein TA:Vittorio Perera.

Hard Problems Some problems are hard to solve. No polynomial time algorithm is known Most combinatorial optimization problems are hard Popular NP-hard.

Performance Analysis: C vs CUDA

On the verification of UML/OCL class diagrams using constraint programming

Chessboard Puzzles Part 3 - Knight's Tour

Chessboard Puzzles Part 2 - Independence

DAA - Notes

Constraint Satisfaction Problems (Chapter 6). What is search for? Assumptions: single agent, deterministic, fully observable, discrete environment Search.