Talk:Maze-solving algorithm: Difference between revisions

Revision as of 13:13, 27 October 2023

Latest revision as of 17:21, 2 July 2024

(3 intermediate revisions by 3 users not shown)

Line 1:

{{WikiProject banner shell|

{{WikiProject Computer science}}

}}

== Random mouse algorithm ==

It is incorrect that random mouse algorithm "will always eventually find the solution". In most cases such algorithm would trap the mouse indefinitely in a section the only exit from which is in the middle of the wall. I would suggest changing the wording to smth along the lines of "may eventually find the solution".

Line 86 ⟶ 87:

: I got a version working. The termination test for wall-following in the paper is sightly off, rendering the proof unsound. But it would be [[WP:OR]] to fix it. Here's my working version in Python.[https://github.com/John-Nagle/lslutils/blob/master/npc/obsolete/mazesolver.py]. But, again, [[WP:OR]]. It's really a variant of Pledge's fix to wall-following, which is already in the article. [[User:Nagle|John Nagle]] ([[User talk:Nagle|talk]]) 23:54, 28 June 2019 (UTC)

== Origin Shift algorithm ==

What about the Origin Shift algorithm, as described in [https://www.youtube.com/watch?v=zbXKcDVV4G0] by CaptainLuma?

Is this a new maze creation algorithm? <!-- Template:Unsigned IP --><small class="autosigned">—&nbsp;Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/193.191.180.235|193.191.180.235]] ([[User talk:193.191.180.235#top|talk]]) 09:39, 2 July 2024 (UTC)</small> <!--Autosigned by SineBot-->

:We cannot include material without published reliable sources. A YouTube video does not meet that standard. —[[User:David Eppstein|David Eppstein]] ([[User talk:David Eppstein|talk]]) 17:21, 2 July 2024 (UTC)