I'm messagingyoubecauseofthe A starpathfindingproject.
It's awesome.
But I found a configurationthatdoesn't findthefinalpath, and I don't knowwhy.
Youknow, I gothimtosendme a screenshotandhegoes, Pleaseignoretheshapeofthewalls.
Sowe'vegotaninterestingbugreporthere.
ItAh, itdidn't findthefinalpath.
Somehowyouknowwhat I thinkmighthavehappened.
StackOverflowerror.
Theonlywaytoknowforsureistorecreatetheissue.
Okay, youtwo, pleasedonotbemonetizedme.
Thisisjustforeducation, notworkforme.
Let's trytodothis.
Oh, stackoverflow.
Error.
Likeif I dothis, it's gonnaIt's gonnacrashguaranteed.
See, itonlygotthatfar.
Sohowdoesthisalgorithmactuallywork?
Thisisourstartnode.
Thisisourendnodehavetocalculatetonumbers.
It's calculatessomethingcalled a G cost.
Wehavetocalculateineachcosts.
AndAggiecostisjustthedistancefromstartnodeand R H costsisjustthedistancefromandknowedifwe'relookingatthissquare, the G onepicksoveronesquaretotheright.
Andnow, whenwelookatoureachkindof a messofgraphhere, butwe'rejustgoingtosaythat h costis 12345 Soweweremarkeddownfive.