N-Queens on 50g (RPL language)
|
11-01-2014, 01:34 PM
Post: #3
|
|||
|
|||
RE: N-Queens on 50g (RPL language)
(11-01-2014 10:03 AM)Werner Wrote: timing on a real 49G: 54_s Excellent! Very clean and efficient. This is a proper implementation of the original algorithm on-stack (mine was just taking the same code and changing GET/PUT with PICK/UNPICK, so not really well thought out). No lists, not even local variables. I think we have a winner here. It will be very difficult for anybody to beat this. I ran it on the 50g for proper comparison: 22.6 seconds, so it smokes my recursive implementation and then some. Great work! I'll edit the original post to report your results as well. Thanks for the entry. Claudio |
|||
« Next Oldest | Next Newest »
|
User(s) browsing this thread: 1 Guest(s)