Prim's algorithm vs ASTAR #coding #programming #algorithm #mazegeneration #maze #mazesolving #python

preview_player
Показать описание

Рекомендации по теме
Комментарии
Автор

Womp womp. They talked to each other so the second algorithm already knows the route.

yesyes
Автор

Damn I remember learning about this in college back in 2013 for algorithms 101. All those algorithms learned but none of em used at my job lol.

EddieVillamor
Автор

As any algorithmphile knows, this is not random

jdsalinger
Автор

best one is a collection of 2x2 dots connected each testing simult. in a matrix of 4 dots

trufinrazvan
Автор

Use flood fill, start with a wall-less map, find a wall and add it to your map, then calculate the “distance” between you on your map to the goal then move so the distance gets lower, repeat
This makes it so it assumes no walls but when they are found it tries to get around them, it’s the most common algorithm in micro mouse racing

kellentownsend
Автор

I would try going from both sides so they can meet at the centre 😉

justforfun
Автор

Also Astar strongly depends on heuristic function

HamedSharafdoost
Автор

Ye Prim’s algorithm is not meant to find the shortest path. Prim’s algorithm find the minimum spanning tree in a graph with weighted edges that are yet to be constructed. Dijkstra’s is the algorithm that finds the shortest path and it is slower than A*. Although Prim’s algorithm is very similar to Dijkstra’s(I think it’s based in it) it is not the same algorithm as it has a completely different goal.

ShadowBoy
Автор

This is just what I do in my head when I’m trying to get through a maze but a computer does it

Iamanidiot-vi
Автор

great video! amazing work, keep it up!

tonyartz
Автор

Its bias minimizing complexity favouring route closest to shortest as it would have diminishing returns if it deviated too far. You can solve quicker by prefering center routes.

bmazor
Автор

You can actually use A* to have it find the least optimal route, and then use that route as a foundation for a maze. It is also usefull for snake pathfinding :/

idk_something
Автор

A* use heuristics, any A* heuristic exploited maze can be designed.

Adhil_parammel
Автор

Me when i placing blocks, making a whole map in labyinth in Blockade Classic (Minecraft based shooting game from my childhood): 🗿

honor_gamer
Автор

Wow, its how I solved mazes as a kid


Wait... am i a machine?

bongocatsupreme
Автор

You build the maze with inverse Prim’s algorithm

josueperez
Автор

This kind computer I like I want to know more about this kind of algorithm stuff

yuvrajchhatwani
Автор

Bro this is the solo leveling sound. It’s an unwritten rule to only use it for solo leveling edits!

the_yamamoto
Автор

Doesn’t seem like an effective maze with all small ends in the middle. But love the effectiveness of it

sharannagarajan
Автор

The second algorithm knows the end location. Prims is searching for the end location.

solacee