# Did anyone done lazy theta star in c#?

Did anyone done lazy theta star in c#?

I found algorithm in c++.
But Iam lazy to rewrite it.

Nope. But take a look at this libraryâ€¦ seems great. (havenâ€™t used it myself though)â€¦

What is lazy theta star? Did you mean A* path-finding?

I think it is. But with different heuristic, different weight methodâ€¦
http://lapinozz.github.io/learning/2016/06/07/lazy-theta-star-pathfinding.html

Nah. I want to make direct walking from 1 point to other point to without lame a* paths, because i use grid. a* not for me, cuz a* cant walk in float in between grid.

I will debug lazy theta star C++ project to get idea how it works. And then I will rewrite it to C# DLL for all to use.

1 Like

I donâ€™t see much different between the lazy theta starâ€™s or an A* ?

A* is particularly to find a path around obsticals. How you assign nodes to a logical grid is in my opinion a matter separate of the algorithm itself.

To be honest it sort of looks like a rip off of the A* algorthm, one that doesnâ€™t warrent enough difference or value to say its anything other then an special case A* variant.

1 Like

Yes I could predefine nodes on corners and do all sorts of stuff, but lets look a head to modern algorithmsâ€¦

There are no â€śmodern algorithmsâ€ť. Just variants on the A* algorithm, which are all quite flexible and mature.

Will Motil is correct when he states that â€śLazy Thetaâ€ť is just another variantâ€¦

Cant disagree, without looking deeper. But yeah these algorithms are similarâ€¦

Here is what you are asking for in C#.

Itâ€™s basically A* based on a static triangular mesh. The line of sight checks between the vertices are done upfront so you might need some tweaking if you have a dynamic mesh.

1 Like