Talk:Pathfinding

	This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing articles
???	This article has not yet received a rating on the project's importance scale.

Video games Low‑importance

This article is within the scope of WikiProject Video games, a collaborative effort to improve the coverage of video games on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Video gamesWikipedia:WikiProject Video gamesTemplate:WikiProject Video gamesvideo game articles

Low

This article has been rated as Low-importance on the project's importance scale.

Summary of Video games WikiProject open tasks:

Summary of Video games WikiProject open tasks

AfDs

Purple Francis (7 participants)
Gilman Louie (2 participants)
Yoshimitsu (3 participants)
Dr. Wily (8 participants)
First Internet Backgammon Server (3 participants)
Emote (2 participants)
Preston Arsement (6 participants; relisted)
Jackpot World (3 participants; relisted)

Merge discussions

Other discussions

No major discussions

Untitled

the example should be removed as it's just ballmann-ford's which is suboptimal in this case as there exist a useful mininmal heuristic (manhattan distance) and A* can there fore solve the problem more effeciently. secondly, the descreption of this algorithm should be on it's own page. —Preceding unsigned comment added by 80.61.123.5 (talk) 20:03, 27 April 2011 (UTC)[reply]

Question

On the "Sample Algorithm", an instruction is ambiguous:

"Check all cells in each list for the following two conditions: If the cell is a wall, remove it from the list If there is an element in the main list with the same coordinate and an equal or higher counter, remove it from the list" The "remove it from the list" part, "it" may refer to the main list element, or the temporary list element. — Preceding unsigned comment added by 187.3.108.197 (talk) 17:19, 30 November 2013 (UTC)[reply]

Yeah, I had to think about this too — it should be made clearer. "it" refers to the temporary list element. The point of this step in the algorithm (step 2.2) is to stop backtracking. For example, during turn two, the element (3,8,2), which is the finish coordinate, will be added to the temporary list because it's adjacent to (2,8,1). But the main list already contains (3,8,0), so (3,8,2) needs to be removed from the temporary list. Scrpy (talk) 13:50, 17 January 2019 (UTC)[reply]

Turning radius?

What about turning radiuses? Doesn't pathfinding take that into consideration? If it does, I think we should write something about how pathfinding works when the object that moves has a turning radius, like for e.g. a car. —Kri (talk) 13:34, 22 May 2014 (UTC)[reply]

RIPA algorithm?

What does it mean (etymology) and where is it from? Who is this Robert Codell? There are no sources linked to it. WingXSaber (talk) 01:53, 25 March 2023 (UTC)[reply]

I rolled back the RIPA algorithm section. There were no citations. 73.71.179.129 (talk) 07:27, 26 August 2023 (UTC)[reply]

Scoutcraft?

Is pathfinding—the plotting of the shortest route between two points, by a computer application—a scoutcraft? That doesn't make that much sense to me considering that scoutcraft are used to sustain yourself independently in the wild country, which usually means that you have no computer accessible. Sure, you can use a cell phone and a solar powered charger, but are there path finding apps used especially by scouts? And does that suffice to count pathfinding as a scoutcraft? —Kri (talk) 01:05, 3 January 2024 (UTC)[reply]