WP-34S N-Queens Benchmark Based on Patrice Torchet's BITMAP Solution
|
10-21-2014, 10:51 PM
Post: #16
|
|||
|
|||
RE: WP-34S N-Queens Benchmark Based on Patrice Torchet's BITMAP Solution
Hi Claudio,
(10-20-2014 01:07 PM)Claudio L. Wrote: I think the array access issue is minor, and doesn't fundamentally change the algorithm (you still have to explore the same number of nodes and do exactly the same tasks.Take the HP-15C: The single indirection swap in the inner loop imply a mostly 33% overhead. For you, I don't know, but for me, it is NOT MINOR. (10-20-2014 01:07 PM)Claudio L. Wrote: I think you should open a new thread and call it the "N-Queens Calculator Competition", (emphasis on "competition" versus "benchmark") where we don't care about comparison or real-world usage, just get the job done with the fastest algorithm optimized the best you can.It just append that a benchmark IS a competition about being the fastest Here is an optimized code for the 15C: the algorithm is exactly the same as in the benchmark. It simply use available features more efficiently. Code: 42,21,11 LBL A Patrice “Everything should be made as simple as possible, but no simpler.” Albert Einstein |
|||
« Next Oldest | Next Newest »
|
User(s) browsing this thread: 1 Guest(s)