KirtUndercoffer.com

Content coming soon

The Queens Problem Revisited, Journal of Pascal, Ada & Modula-2, 1987

Solving the 8-Queens Problem using random walks. The random walk approach can be extended to N-Queens to generate individual solutions. I have generated solutions for n >= 100, which is much higher than most people have thought that a random walk can be applied to in this problem because of the exploding state space. I will post some of the solutions here.

Project Euler
Level 3, 77 problems solved

Last Update 2021-1-14