boxes are crossed when a dead end is reached. but you have crossed boxes also when the mouse reaches the destination box. on what basis is that done.?
@itisallrightaz12 жыл бұрын
can you give us your code of this simulation? thks so much!
@mohammedkhdair15358 жыл бұрын
can you give me the code, please?
@JayVyasjayunit10012 жыл бұрын
i like this music :) and the algorithm :)
@ahmedgamberli22503 жыл бұрын
I've a question. First of all, your tutorial is very nice! Let's come to my question. Can I use Flood-Fill algorithm for a normal labyrinth master? I think it's highly possible!
@XfStef4 жыл бұрын
This look like Fill Flood + A* for searching.
@NeilRoy9 жыл бұрын
I don't understand why the "mouse" is moving to larger numbers, if it just stuck to lower numbered cells it would reach the center faster. From the start, if it just moved to 4 then 3, then 2, it would be on the right path. It just need to head to the lowest numbered cell which it hasn't visited yet.
@mohammadislm9 жыл бұрын
+Neil Roy It tries all possible routes is in discovery mode during the first run. The easiest/shortest path is determined in the final run.
@andrewmilad91105 жыл бұрын
انت مصري ؟ محتاج اسأل حضرتك علي حاجة ضروري Are you Egyptian ? I need to ask you some necessary question please