Tag: n-queen problem
- 01
Apr - 2018Real Time Systems
5 min | 14853#Raspberry Pi: The N-queens Problem (benchmark) Preempt-RT vs. Standard Kernel
Real Time Systems | 5 min | 14853
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 ToolsAs you can see, there aren't two queens on the same row, column or diagonal. Usually t...
We use cookies to improve our services. Read more about how we use cookies and how you can refuse them.