Tag: n-queen problem
#Raspberry Pi: The N-queens Problem (benchmark) Preempt-RT vs. Standard Kernel
Real Time Systems | 5 min | 12436
N-Queens Problem: A Benchmarking Solver for Raspberry Pi
The N-Queens Problem/Puzzle is a well-known problem that consists of placing N chess queens on an N × N chessboard so that no two queens attack each other. For example, one possible solution to the N-queens problem for N = 4 is the following:
Fig. 1: N-queens problem example (N = 4).
Source: Google Optimization Tools
As you can see, there aren't two queens on the same row, column or diagonal. Usually t...