Thread: What do u think of my current project?

  1. #16
    Join Date
    May 2004
    Literally it is pronounces 'a star' when you say it out loud. But hey, nobdy here actually talks to real human beings, right?

  2. #17
    I am he who is the man! Stan100's Avatar
    Join Date
    Sep 2002
    Quote Originally Posted by XSquared
    I run a dual monitor setup, and when i go to the edge of the sceen, instead of keeping the mouse within the window, it lets me go off the edge of the screen onto the other monitor. Quite annoying.

    I haven't dl-ed it, but everyone seems to like it. I could see how the above could be annoying, but there's no way anyone would have even made an attempt to guess someone would run dual-monitors. It's kinda hard to code for that
    Stan The Man. Beatles fan

    When I was a child,
    I spoke as a child,
    I thought as a child,
    I reasoned as a child.
    When I became a man,
    I put childish ways behind me"
    (the holy bible, Paul, in his first letter to the Cor. 13:11)

  3. #18
    Registered User MiLo's Avatar
    Join Date
    Jun 2004
    I also dual moniters and i don't so much mind it. It would allow me to do other stuff at the same time on my other moniter. Some games are annoying that way. I can't do other stuff. But my guess is it is more of a standard to not let me do other stuff, so maybe you do want to change it. I dunno. I personally like it.

  4. #19
    l'Anziano DavidP's Avatar
    Join Date
    Aug 2001
    Plano, Texas, United States
    A* is pretty much the most popular pathfinding method out there. It is a combination of the Breadth-First and Depth-First searches, if you have ever studied them.

    That is the best A* tutorial I have ever found. Use it.

    Also, when coding and A* algorithm, simplicity, recursion, and lots of smaller functions are your friends
    My Website

    "Circular logic is good because it is."

  5. #20
    vae victus! skorman00's Avatar
    Join Date
    Nov 2003
    Be careful with A*. It's a very intense search. If you're going to use it, make sure you aren't using it wastefully. With the terrain I see so far, it doesn't look like you're going to have too many obsticles or different terrains, so you can probably get away with a "best first" algorithm. I'd also run it on a seperate thread, but that's just me. If you do use A*, there are many things you can do to limit it how much CPU time it will take. If you are interested, I'd be glad to give some pointers, and I'm sure the others will, too.

    Do you plan on having other units or perhaps structures? If so, what do you have in mind?

    Quote Originally Posted by DavidP
    Also, when coding and A* algorithm, simplicity, recursion, and lots of smaller functions are your friends
    I have used recursive searches when looking through sections that I have already processed, but I'd be interested to hear if you've found other beneficial places where it can be used.
    Last edited by skorman00; 06-21-2004 at 01:39 PM.

  6. #21
    Registered User MicroFiend's Avatar
    Join Date
    Nov 2002
    i was actually surprised, before i posted this program i was designing a pathfinding routine, my first ideas were obviously the simplest, just a "colide -> re-evaluate destination" solution, but then i thought of (as my terrain is stored in a 100x100 UCHAR array) routine which views the entire solutions and finds all possible means of reaching its point, however i dismissed this idea due to the huge usage of processing, well that is until i read the a-star method ya'll like so much and i was amazed that it resembled (slightly) the method i thought of, i am having trouble designing the solution however (unless i want to run the game @ 2fps heh) the rts is gonna be designed to have way more stuff, many different classes of units, terrain objects, buildings etc (if ne of u ever played Populous3 or Warcraft 2 ud know what im aiming for) i know with objects i could just use a directional change on colide,
    You can stop change as easily as u can drink the sea with a fork

  7. #22
    l'Anziano DavidP's Avatar
    Join Date
    Aug 2001
    Plano, Texas, United States
    the first time i attempted A* i was overwhelmed. I knew all the theory behind it, especially since I had just finished a semester at college in which I had studied the BFS and the DFS searches, however, coding the A* algorithm was a pain the first time I tried it out. The main reason was I did not seperate it enough into different segments and I tried to do it iteratively instead of recursively...and that will kill your mind.

    I scrapped the code after 1 night of working on it and started fresh the next day. That time I used plenty of functions to seperate each different part of the algorithm, and I thought about it recursively rather than iteratively. It was a breeze. I had it up and running within an hour, seriously. I loved it.
    My Website

    "Circular logic is good because it is."

Popular pages Recent additions subscribe to a feed

Similar Threads

  1. Open-source Game Project
    By Glorfindel in forum Projects and Job Recruitment
    Replies: 0
    Last Post: 03-24-2009, 01:12 AM
  2. Need help with program.
    By olgirl4life in forum C++ Programming
    Replies: 3
    Last Post: 12-11-2006, 11:06 PM
  3. BST delete again, but this time I think I'm close
    By tms43 in forum C++ Programming
    Replies: 9
    Last Post: 11-05-2006, 06:24 PM
  4. Problem with simple case statements
    By shoobsie in forum C Programming
    Replies: 2
    Last Post: 05-08-2006, 08:39 AM
  5. DJGPP project problems
    By VirtualAce in forum A Brief History of
    Replies: 4
    Last Post: 06-08-2002, 07:16 PM