![]() |
NQueensLast updated: January 19, 2003 |
![]() |
NQueens solves the classical 8 queens problem, where 8 queens are to be placed on a check board without any queen attacking any other.
| From | To | Value |
|---|---|---|
| 8 | 8 | 0.003 |
| 16 | 16 | 0.091 |
| 24 | 24 | 0.297 |
| 32 | 32 | 0.052 |
| 40 | 40 | 0.142 |
| 48 | 72 | 0.338 |
| 80 | 136 | 0.045 |
| 144 | 392 | 0.025 |
| 400 | +Inf | 0.007 |
| From | To | Value |
|---|---|---|
| 1 | 1 | 0.973 |
| 2 | 2 | 0.025 |
| 3 | +Inf | 0.002 |
| From | To | Value |
|---|---|---|
| 1 | 1 | 0.983 |
| 2 | 2 | 0.015 |
| 3 | +Inf | 0.002 |
| From | To | Value |
|---|---|---|
| 1 | 1 | 0.936 |
| 2 | 2 | 0.043 |
| 3 | +Inf | 0.003 |
| From | To | Value |
|---|---|---|
| 1 | 1 | 0.970 |
| 2 | 2 | 0.008 |
| 3 | +Inf | 0.003 |
| From | To | Value |
|---|---|---|
| 1 | 1 | 0.667 |
| 2 | 2 | 0.333 |
| 3 | +Inf | 0.000 |
| From | To | Value |
|---|---|---|
| 1 | 1 | 0.667 |
| 2 | 2 | 0.333 |
| 3 | +Inf | 0.000 |
| From | To | Value |
|---|---|---|
| 1 | 1 | 0.529 |
| 2 | 2 | 0.471 |
| 3 | +Inf | 0.000 |
| From | To | Value |
|---|---|---|
| 1 | 1 | 0.529 |
| 2 | 2 | 0.471 |
| 3 | +Inf | 0.000 |