Alextro's Profile

- alextro
- - Joined 22 Feb, 2012
  - 36 topics • 1,610 posts
- 1
- 13 Apr, 2016
- Quote
I also made laser guide with bouncing angle:
- alextro
- - Joined 22 Feb, 2012
  - 36 topics • 1,610 posts
- 1
- 13 Apr, 2016
- Quote
Take my example, you will learn something from it:
- alextro
- - Joined 22 Feb, 2012
  - 36 topics • 1,610 posts
- 1
- 12 Apr, 2016
- Quote
I modified R0J0 example, make it compact & intuitive (and touch friendly) bitwise_mod.capx
- alextro
- - Joined 22 Feb, 2012
  - 36 topics • 1,610 posts
- 1
- 10 Apr, 2016
- Quote
Snake movement covered in following thread:
- alextro
- - Joined 22 Feb, 2012
  - 36 topics • 1,610 posts
- 1
- 8 Apr, 2016
- Quote
What do you want to do by using platform behavior? Do the runner need to jump or else?
- alextro
- - Joined 22 Feb, 2012
  - 36 topics • 1,610 posts
- 1
- 8 Apr, 2016
- Quote
That's a lot of example R0J0. I think I need extra time to understand them. I red that dijkstra algorithm is the most shortest possible route calculation.
- alextro
- - Joined 22 Feb, 2012
  - 36 topics • 1,610 posts
- 1
- 7 Apr, 2016
- Quote
So they are end up stacked behind the finish, right? Sure runner can gain speed again by using lerp from 0 to max.

Done.

Please download again from previous link, it's updated.
Try Construct 3

Develop games in your browser. Powerful, performant & highly capable.
Try Now Construct 3 users don't see these ads
- alextro
- - Joined 22 Feb, 2012
  - 36 topics • 1,610 posts
- 1
- 6 Apr, 2016
- Quote
Thanks R0J0hound for cover every possibility with it's pros and cons. A* seems fair enough for fixed same distance (grid). I always think there must be other way than using overlapping test. Since JS not my thing, I'd like to see an example that utilizing array like you said.
- alextro
- - Joined 22 Feb, 2012
  - 36 topics • 1,610 posts
- 1
- 5 Apr, 2016
- Quote
I would like to improve the searching time by implement bidirectional search with dual floodfill.

Say A is starting point and B is the goal. Both point will flooding their neighbour until they flooded certain point that will act as an intersection, let's call it "C". Then The result is path cost/step to reach C for both that bring us to total cost by sum up them:

Total_cost = A_cost + B_cost

Now we just need to traceback from A. However the traces from B need to be converted to cost "how far them from A". We need to write new value from existing b_cost towards the goal.

Total_cost-B_cost = A_cost

So now early traces from B got an A_cost in correct order to complete entire node path. That should relatively fast in theory.

Time to implement the idea.
- alextro
- - Joined 22 Feb, 2012
  - 36 topics • 1,610 posts
- 1
- 5 Apr, 2016
- Quote
Iolva
1. It just use standard default features from C2 so no additional plugin were involved.

2. About 280 events for main gameplay

3. The manual is not finished yet. I admit it is my weakest point at this stage.
- alextro
- - Joined 22 Feb, 2012
  - 36 topics • 1,610 posts
- 1
- 2 Apr, 2016
- Quote
Me, a cartoon-ish cat made with vector & raster software framed with 9-patch object that resembled of puzzle stuff.
- alextro
- - Joined 22 Feb, 2012
  - 36 topics • 1,610 posts
- 1
- 2 Apr, 2016
- Quote
Thank you Iolva really something to me.