8-Queens Benchmark

[xerxes]

(08-25-2024 02:53 PM)Hlib Wrote:  In CASIO and in Texas Instruments models, this leaves much to be desired.

I like your optimizations, but the goal of this integer benchmark was not to find out what's the best way with every language to solve n-queens.
For me it was more important to implement the same algorithm in a similar way on all computers. Regardless of whether structured or unstructured, both versions follow practically the same execution path. It is true that sometimes some optimizations were made, such as ISZ, DSZ or other small things. On the other hand, I avoided things like FOR NEXT so that the structure of the test code was more or less preserved. I know that this was not always implemented optimally, but it was good enough to have a useful comparison. If we now use a different test code that is a bit faster but the execution path has been significantly changed, we would have to question all the other test codes and look for better implementations to be fair. Unfortunately I do not have the opportunity to do this for all computers again, as I no longer have access to most of them. I don't think that's a problem, because it's certainly clear to everyone that this benchmark, like others, is just an example and depending on which task you're using to test, the results might be slightly different.