Talk:I'm a software engineer, get me out of here: Difference between revisions
Talk:I'm a software engineer, get me out of here (view source)
Revision as of 12:04, 29 August 2018
, 5 years ago→Algorithm
(Created page with "==Algorithm== I think the use of Dijkstra's and Floyd-Warshall algorithms should be a suggestion rather than a requirement. Anyway, I've used a simple breadth-first algorithm...") |
|||
Line 2:
I think the use of Dijkstra's and Floyd-Warshall algorithms should be a suggestion rather than a requirement.
Anyway, I've used a simple breadth-first algorithm for the Phix entry. [[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 21:00, 17 August 2018 (UTC)
:Thank you for your contribution, sadly your last as I read in this morning's standing orders that you were shot at dawn. Part 1 is to find a list of the shortest routes to safety. I interpreted this as meaning all points of safety which could be reached in 5 days. Having supplied only one which turned out to have LARC (Liberation Army of RosettaCode - objective Liberate the president's gold) waiting, the president assumed you were part of the conspiracy. Just because he's paranoid it doesn't mean no-one is out to get him. Further the extra credit is "Which cells will it take longest to send reinforcements to from HQ?". HQ is at (11,11) (or 12,12 if indexing starts at 1 as God intended), so I'm not sure what {"show_longest",{{23,13},{21,15},{4,20},{7,21},{18,21}}} answers. At the end of 2011 people were asking why RC's Dijkstra task was still draft. Mid 2018 I have updated that task so that it may be implemented consistently and raised it to full status. One of the requests was for a non trivial example, I would like this maze to be that. They also suggest that Floyd could be used equivalently, which may be for the trivial examples they give, tried here one sees the difference. So I think this task's specification is clear and should be adhered to.--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 12:04, 29 August 2018 (UTC)
| |||