Algoritmo A*: differenze tra le versioni

Versione delle 17:03, 16 nov 2018

Versione delle 03:59, 17 mag 2019

Riga 114:

== Collegamenti esterni ==

* {{en}} Justin Heyes-Jones' [http://www.heyes-jones.com/astar.html A* algorithm tutorial]

* {{cita web|1=http://www.policyalmanac.org/games/aStarTutorial.htm|2=Another A* Pathfinding for Beginners|lingua=en|urlmorto=sì|accesso=28 gennaio 2006|urlarchivio=https://web.archive.org/web/20051224192823/http://www.policyalmanac.org/games/aStarTutorial.htm|dataarchivio=24 dicembre 2005}}

* {{en}} Amit's [http://theory.stanford.edu/~amitp/GameProgramming/ Thoughts on Path-Finding and A*]

* {{en}} Sven Koenig's [http://idm-lab.org/applet.html Demonstration of Lifelong Planning A* and A*]

* {{en}}Remko Tronçon and Joost Vennekens's {{collegamento interrotto|1=[http://www.cs.kuleuven.ac.be/~remko/jsearchdemo/ JSearch demo] {{Webarchive|dateurl=febbraio 2018https://web.archive.org/web/20060211143354/http://www.cs.kuleuven.ac.be/~remko/jsearchdemo/ |botdate=InternetArchiveBot11 febbraio 2006 }}: demonstrates various search algorithms, including A*.

* {{en}} Sune Trudslev's [https://web.archive.org/web/20060721132449/http://www.tanis.dk/wiki/index.php/Path_finding_in_C_sharp Path finding in C# article]