Part of the Khronos Group
OpenGL.org

The Industry's Foundation for High Performance Graphics

from games to virtual reality, mobile phones to supercomputers

Results 1 to 2 of 2

Thread: Spreading problem

  1. #1
    Junior Member Newbie
    Join Date
    Jul 2009
    Posts
    1

    Spreading problem

    Hi, I've been trying to design an optimal spreading program for this computer game: www.node-def.com, but I lack the mathematical skill to solve this trough calculation, so I hope you guys can help me on this.

    The idea is that you program a node, wich will perform the programmed instructions according to priority and possibility. All I am intrested in, is how I can program a node to let it replicate itself as fast as possible.
    The node can be instructed to replicate in all direction, withing 360 degree. Between a distance of 1-100.
    To create a new node costs 2 seconds, to travel a distance of 1 takes 0.1 second, to transfer the programmed instructions takes 0.3 second per instruction, i.e. replication order.
    The diameter of a node is 20 distance.
    What I would like is a node that spreads forward as fast as possible and as close as possible.

    I hope someone knows the solution for this.

    Jordian

  2. #2
    Member Regular Contributor
    Join Date
    Mar 2003
    Location
    Los Angeles
    Posts
    374

    Re: Spreading problem

    This doesn't seem like an OpenGL question.
    Am I doing your homework for you?

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •