Talk:A* search algorithm: Difference between revisions
→Related Tasks
m (→Related Tasks: anssered/added my reasoning about related tasks.) |
|||
Line 38:
: The <u>algorithm</u> used for the '''A*''' search isn't related to a Hidato puzzle, but parts of the (computer program) solution may be used, especially the presentation of the solution/answer(s), but that's not the reason I added those other tasks; they appear to me as related tasks in that quite a bit (at least my solution, as yet not included) had a lot of code in common. --- Not that everyone else may have had the same observation. I never intended to imply that the same algorithm (or a even a modified one) could/would/should be used (or even considered) for those other related tasks. In no way does a related task imply the same algorithm could or should be used or applied to another task. To answer your second question, no, I am not going to use this algorithm to solve ''any'' other Rosetta Code problem. That's not what a ''related task'' means to me. I also believe that ''related'' doesn't necessarily mean ''similar'' in this context. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 21:41, 30 January 2017 (UTC)
:Wherein lies the problem. Do you think that the Rexx (and some other) solutions implement the '''A*''' search algorithm? From Wikipedia:<br>
::Typical implementations of A* use a priority queue to perform the repeated selection of minimum (estimated) cost nodes to expand. This priority queue is known as the open set or fringe. At each step of the algorithm, the node with the lowest f(x) value is removed from the queue, the f and g values of its neighbors are updated accordingly, and these neighbors are added to the queue. The algorithm continues until a goal node has a lower f value than any node in the queue (or until the queue is empty).<br>
:Specifically, there is no back-tracking in '''A*'''. Of course the task description does not clearly specify what is meant by '''A*''' but if anything goes then I think '''A*''' should be removed from the task's title allowing any way to find this path. Alternatively the task description should be clear and some of the solutions marked incorrect.--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 14:39, 21 November 2017 (UTC)
| |||