SY submitted the entry that won our 1000 Node Challenge. Congratulations! If one of your contributions were part of this entry, please leave a comment and let everyone know.
We’re now in the final stretch. The queue closes at noon on Wednesday. Good luck.
I agree with Oliver that if possible making the final few hours of the contest conceal the entries will be make for a better end.
I credit Oliver Woodford completely for the submissions I made to the 1000 Node challenge yesterday. I selected one of his earliest Dijkstra entries and reduced the node count to be less than 1000. I then slowly during the day added the small tweaks contained within the regular contest code. It could be seen I slowly pushed the 1000 node score lower until I had to leave for class. When I added the double to int data-type change that seemed to hold steady for quite some time until the rand function was introduced.
When does late stage twilight begin, and will it then run on until the end of the contest?
I agree with Oliver that if possible making the final few hours of the contest conceal the entries will be make for a better end.
I credit Oliver Woodford completely for the submissions I made to the 1000 Node challenge yesterday. I selected one of his earliest Dijkstra entries and reduced the node count to be less than 1000. I then slowly during the day added the small tweaks contained within the regular contest code. It could be seen I slowly pushed the 1000 node score lower until I had to leave for class. When I added the double to int data-type change that seemed to hold steady for quite some time until the rand function was introduced.
Much obliged, Mike.
For anyone looking for a speed boost to that approach I recommend “Basic Bellman-Ford”.
To Oliver:
There will not be a late stage twilight in this contest. So it’s full daylight right to the end.