A star algorithm

Is it possible to "code" A star (A*) algorithm in Construct 2?

I know there is PathFinder behavior, but i'd like to kode it in construct events to show in school that contsruct also can do it (not only programming language).

Events aren't well suited to highly algorithmic code like the A* algorithm - that's part of what plugins are for, to offload the algorithmic things. So I'd go for the PathFinder behavior.

I agree with Ash but if it's just to show off a bit, you can try adaptating r0j0's cap into a capx (you need to download construct classic)

http://69.24.73.172/scirra/forum/viewtopic.php?f=8&t=8368&p=63821&hilit=pathfinding

I think it's pretty doable, all functionalities you need are in c2 already (except for the foreach ordered... But it's just to set random start and goal on start of layout)

Here is an example for grid based astar pathfinding. It's useful for a visualization of the algorithm, but plugins are better suited for something like this. As it is it's a bit laborious to re-implement it for every project.

http://dl.dropbox.com/u/5426011/examples%208/astar.capx

Thank you.