Commit 9bc5431

authored

Update README.md

1 parent 433d052 commit 9bc5431Copy full SHA for 9bc5431

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -8,7 +8,7 @@ The project is implemented in Python using Pygame. We create a grid, we draw it`
`8`	`8`
`9`	`9`	`## Algorithms`
`10`	`10`
`11`		`-*A Search** - the best pathfinding algorithm as it always finds the shortest path and does it much faster than Dijkstra by using a heuristic function that aproximates the distance between the currently probed node and the end node.`
	`11`	`+A-star Search - the best pathfinding algorithm as it always finds the shortest path and does it much faster than Dijkstra by using a heuristic function that aproximates the distance between the currently probed node and the end node.`
`12`	`12`
`13`	`13`	`Best First Search - also uses a heuristic function to determine the approximate distance between nodes, but does not guarantee neither the shortest path, nor finding the actual end node.`
`14`	`14`

Comments

(0)