Skip to content

Latest commit

History

6 Commits

Folders and files

NameName
Last commit message
Last commit date

Repository files navigation

A* in Go

This is a very small (120 sloc) single file, single function A* implementation in Go.

I implemented it to use in games with tile-based maps. It's not trying to be super-generic or super-flexible. It's just small and straightforward.

The only function is FindPath and the only data structure is Point.

typePointstruct {
X, Yint
}
funcFindPath(grid [][]byte, start, endPoint) []Point

About

Very small A* algorithm implementation in Go

Topics

Resources

Stars

1 star

Watchers

0 watching

Forks

Releases

Packages

Contributors

Languages