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 17:33, 4 January 2021
, 3 years ago→The Problem's Wording
(→Problem Wording: suffix 'signature' markup to my comment) |
|||
| (3 intermediate revisions by 2 users not shown) | |||
Line 21:
--[[User:Wherrera|Wherrera]] ([[User talk:Wherrera|talk]]) 04:39, 20 September 2019 (UTC)
== The Problem's Wording ==
I have a bit of trouble understanding the wording of the problem, and if my reading is correct, then perhaps the problem should be changed to a slightly more challenging one! Here's a copy of the current wording:
Line 37:
My understanding of this wording is that the small positive integer in each cell of unsafe territory denotes the number of steps that can be taken in a turn that begins in that cell. However, this is slightly unrealistic, unless you allow excuses as far-fetched as the high-numbered cells containing sufficiently level regions for tactical airlifts; perhaps the numbers can denote the reciprocal of a cost function, and the allowance per turn is steps totalling one cost unit? --[[User:Adlai|Adlai]] ([[User talk:Adlai|talk]]) 11:06, 2 January 2021 (UTC)
: Let's see your CommonLisp implementation of this "trivial problem" as it stands, before we complicate matters. --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 13:56, 2 January 2021 (UTC)
:: My questioning of the problem's wording, and the suggestion either it or the challenge istelf be changed, were not intended to imply that the current version was trivial, only to confirm that my understanding of the text was correct, without reading other people's implementations before writing my own. I have noticed that it is common for submitted code to be direct translations from another language, although was not planning on doing that here. --[[User:Adlai|Adlai]] ([[User talk:Adlai|talk]]) 16:44, 4 January 2021 (UTC)
::: Yes, your interpretation is correct. The number indicates how many squares to hop horizontally or vertically, or both in the diagonal case. Thus a 2 in (10,10) would land in (8,8), (8,10), (8,12), (10,8), (10,12), (12,8), (12,10), or (12,12). It is however "in a day" rather than a "turn" or "cost", and we're looking for fewest total days rather than shortest travelled distance. One of the reasons why translations are so prevalent and readily accepted is that this is a language comparison site, and that tends to be easier when submissions are using the same algorithm. <del>However better/novel/interesting and just plain weird alternative algorithms are of course also welcome, and each language can have more than one.</del> Oh, scratch that, I forgot this task specifically asks that Dijkstra's and Floyd-Warshall algorithms be used. --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 17:19, 4 January 2021 (UTC)
| |||