First of all, I'm from Argentina so english is not my fist language, so i want to apologise beforehand for any mistakes.
I'm a computer enthusiast and I love to program whatever comes to my mind, specially when it comes to benchmarking. Lately the "N Queens problem" has been in my mind since i read an article in the newspaper. The problem states that given N queens and an NxN chessboard, find a way to place the queens so that no two queens attack each other. As you can imagine its a pretty process intensive problem for big numbers of N (with an i7 950 @ 4.2ghz trying to find 1 solution for N = 40 took little more than 21 hours).
Im still working in the multithread. As it stands right now, the program does the same process in each thread, that is if you want to find 1 solution with 10 threads, all 10 threads will find the same solution.
The program also lets you chose if you want to separate the process in iterations, how much time you want to process each iteration and how much time you want to wait between each iteration. I programed this to simulate the normal use of a computer in order to break in an AS5 i bought (lol).
Inputs:
Output per thread:
Output Summary:
I hope you enjoy this as much as i enjoy making it. I'll be updating the program, so I'll be posting the updates here.
nQueens.zip