Eight Queens Problem: 


A famous algorithm. It’s goal is to find all solutions on how to place eight queens on a checker board without checking themselves. It shows you how good your system can handle function calls. This is a recursive version after Niklaus Wirth (ETH Zürich). The results depend mostly on the latency time of the CPU. This means, the shorter the pipeline, the better the results. Alpha and AMD K6 systems are the fastest at this test.

 

Back to TOC