'How can MIN-CONFLICT algorithm solve million-queen on average of 50 steps? [closed]
Many materials tells that the minimum conflict method can be independent of N and solve the n-queen problem with n = 1000000 in about 50 steps on average. I find implementation on github is too slow to solve million-queen and I haven't find such an efficient implementation after turning over a lot of materials on the Internet. Look at the pseudo code on the wikipedia and randomly select a queen that has the least conflict with the current queen to be moved. It feels impossible to complete this step with O (1). Could you please help me?
Sources
This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.
Source: Stack Overflow
| Solution | Source |
|---|