Hi !
Featured games (90)
games approved by the League of Dukes
Games in Showcase (725)
Games in Android Showcase (216)
games submitted by our members
Games in WIP (791)
games currently in development
News: Read the Java Gaming Resources, or peek at the official Java tutorials
    Home     Help   Search   Login   Register   
Pages: [1]
  ignore  |  Print  
  Looking for a suggestion, pseudo code or article on paths  (Read 966 times)
0 Members and 1 Guest are viewing this topic.
Offline Darrin

Junior Devvie

Projects: 1

« Posted 2009-05-12 15:51:20 »

I have a couple ideas for some games but I'm not sure how to implement it.  I was wondering if anyone had any suggestions.

Here is the basic idea.

I want the player to move around the edge of multiple rectangles.    The rectangles can be any size and there can be multiple ones but the player sprite has to stay on the side.   If the rectangles share a side the player can move to either rectangle

|    |--x--
|    |     |
-----      |
     |     |


Would you set up each rectangle as an object then just check its bounds versus the players attempt at movement?  For example if the player attempts to move Right, the code checks to see if the player coordinates are only the top or bottom plane of a rectangle?  If the player is not on that plane, right is not allowed?

Is there a better way to set up a player path? 

Offline Eli Delventhal

JGO Kernel

Medals: 42
Projects: 11
Exp: 10 years

Game Engineer

« Reply #1 - Posted 2009-05-12 16:41:50 »

I'd probably just do some smart linking at level initialization. Pretty much, give each Rectangle a List of north, south, east, and west linked rectangles. When you first load up your level, do bounds checking to populate the list, then all you need to do during the game is know what side of which rectangle the the player currently is, and then only check against the bounds of the rectangles in that list.

I'm on the north side of RectangleX.
RectangleX has RectangleY, RectangleZ, and RectangleW in its north List.
I iterate through those 3 rectangles in the north list and see if I'm within the bounds of any of them.
I move to the one that I'm within, or I don't move at all.

You've still got ways to make this faster but it will probably be cheap enough in most situations, because you are unlikely to ever be comparing against more than 3 rectangles at a time, and bounding box collision is cheap.

See my work:
OTC Software
Pages: [1]
  ignore  |  Print  
You cannot reply to this message, because it is very, very old.

Archive (55 views)
2017-04-27 17:45:51

buddyBro (266 views)
2017-04-05 03:38:00

CopyableCougar4 (689 views)
2017-03-24 15:39:42

theagentd (691 views)
2017-03-24 15:32:08

Rule (734 views)
2017-03-19 12:43:22

Rule (709 views)
2017-03-19 12:42:17

Rule (713 views)
2017-03-19 12:36:21

theagentd (723 views)
2017-03-16 05:07:07

theagentd (656 views)
2017-03-15 22:37:06

theagentd (497 views)
2017-03-15 22:32:18
List of Learning Resources
by elect
2017-03-13 14:05:44

List of Learning Resources
by elect
2017-03-13 14:04:45

SF/X Libraries
by philfrei
2017-03-02 08:45:19

SF/X Libraries
by philfrei
2017-03-02 08:44:05

SF/X Libraries
by SkyAphid
2017-03-02 06:38:56

SF/X Libraries
by SkyAphid
2017-03-02 06:38:32

SF/X Libraries
by SkyAphid
2017-03-02 06:38:05

SF/X Libraries
by SkyAphid
2017-03-02 06:37:51 is not responsible for the content posted by its members, including references to external websites, and other references that may or may not have a relation with our primarily gaming and game production oriented community. inquiries and complaints can be sent via email to the info‑account of the company managing the website of java‑
Powered by MySQL Powered by PHP Powered by SMF 1.1.18 | SMF © 2013, Simple Machines | Managed by Enhanced Four Valid XHTML 1.0! Valid CSS!