Programming C, C++, Java, PHP, Ruby, Turing, VB
Computer Science Canada 
Programming C, C++, Java, PHP, Ruby, Turing, VB  

Username:   Password: 
 RegisterRegister   
 Turing Jetman help (Please i need help this is for my ISP)
Index -> Programming, Turing -> Turing Help
View previous topic Printable versionDownload TopicSubscribe to this topicPrivate MessagesRefresh page View next topic
Author Message
adigamov




PostPosted: Sat Dec 15, 2007 12:30 am   Post subject: Turing Jetman help (Please i need help this is for my ISP)

hi there
my name is denis
im in a grade 9 enrichement program and we have turing for tech.
i have to make a jetman isp and i already have an idea of how to make the map.
for the map i can just randint the obstacles and instead of moving the guy along the screen as you hold the mouse
the guy just moves up and down as you hold the mouse. the obstacles and such just move TO you but it looks like your moving forward
a big problem for me is how to make and infinite variable and how to make it that it does something when they make contact. i have no idea
how to make stuff happen as they make contact so can sum1 please help me.
i need to have my plan done by wednsday. i am in trouble. please and thank you. Exclamation Exclamation
Sad BooHoo Sad
Sponsor
Sponsor
Sponsor
sponsor
StealthArcher




PostPosted: Sat Dec 15, 2007 12:35 am   Post subject: Re: Turing Jetman help (Please i need help this is for my ISP)

There are some tutorials on collision here, search the help section. If you are completely lost look at my game somewhere back on the 7th page of submissions, it isn't complete, and won't get your work done for you, but it's a start and can help explain things, do not copy though, or dan will hack you. Razz Laughing
Tony




PostPosted: Sat Dec 15, 2007 12:37 am   Post subject: Re: Turing Jetman help (Please i need help this is for my ISP)

adigamov @ Sat Dec 15, 2007 12:30 am wrote:

a big problem for me is how to make and infinite variable

what do you mean by an "infinite variable"?

"making contact" is commonly covered under collision detection. There are a bunch of different methods of various precision, it basically comes down to simple geometry, and checking if there's any overlap between two objects (circles and rectangles are common basics).
Latest from compsci.ca/blog: Tony's programming blog. DWITE - a programming contest.
chrisciscoioio




PostPosted: Sat Dec 15, 2007 5:49 pm   Post subject: Re: Turing Jetman help (Please i need help this is for my ISP)

Tony @ Sat Dec 15, 2007 12:37 am wrote:

adigamov @ Sat Dec 15, 2007 12:30 am wrote:

a big problem for me is how to make and infinite variable

what do you mean by an "infinite variable"?


He means he wants to be able store an infinte number of objects.

Well I can answer that as well, you can't.

But think of it this way, pick a number say 256, I doubt you have more objects than that. To small try 512, I mean unless you are making huge maps, and you want to draw the whole map every time, you are not going to more than 50 at the most on a single map, considering this is a grade 9 ISU.
SNIPERDUDE




PostPosted: Sat Dec 15, 2007 6:36 pm   Post subject: RE:Turing Jetman help (Please i need help this is for my ISP)

I would recommend that way since it is a grade 9 project.

However if you wanted it to be 'infinate' you would just have an array storing the obstacles that is only as large as that will fit on the screen. So when an obsacle reaches the end of the screen, it would move to the back with a new randomized obstacle.
Tony




PostPosted: Sat Dec 15, 2007 6:47 pm   Post subject: Re: RE:Turing Jetman help (Please i need help this is for my ISP)

SNIPERDUDE @ Sat Dec 15, 2007 6:36 pm wrote:
However if you wanted it to be 'infinate' you would just have an array storing the obstacles that is only as large as that will fit on the screen.

the size of the screen is very much finate. Relatively small in size too.

Assuming a need to store (and use) a large amoung of objects in memory, an array will probably be a poor choice, as that requires a large block of memory, which might not be available. Linked lists could better utilize all of the available memory space.

Or use B-trees and store stuff on that 500GB external harddrive. For all practical, Turing made, purposes, this is pretty much "infinite" space.

Of course all of this is not at all a grade 9 level.

circular arrays are very nice, if you can understand how to use them.
Latest from compsci.ca/blog: Tony's programming blog. DWITE - a programming contest.
chrisciscoioio




PostPosted: Sat Dec 15, 2007 11:46 pm   Post subject: Re: Turing Jetman help (Please i need help this is for my ISP)

Your rught tony, but it is a grade 9 project, so they are simple ways, not the best, but since when is turing the best?
Tony




PostPosted: Sun Dec 16, 2007 12:10 am   Post subject: RE:Turing Jetman help (Please i need help this is for my ISP)

Turing is quite sufficient for the simple things. You'd be hard-pressed to find a single language that would be "the best" for everything.
Latest from compsci.ca/blog: Tony's programming blog. DWITE - a programming contest.
Sponsor
Sponsor
Sponsor
sponsor
adigamov




PostPosted: Wed Dec 19, 2007 10:39 pm   Post subject: Re: Turing Jetman help (Please i need help this is for my ISP)

adigamov @ Sat Dec 15, 2007 12:30 am wrote:
hi there
my name is denis
im in a grade 9 enrichement program and we have turing for tech.
i have to make a jetman isp and i already have an idea of how to make the map.
for the map i can just randint the obstacles and instead of moving the guy along the screen as you hold the mouse
the guy just moves up and down as you hold the mouse. the obstacles and such just move TO you but it looks like your moving forward
a big problem for me is how to make and infinite variable and how to make it that it does something when they make contact. i have no idea
how to make stuff happen as they make contact so can sum1 please help me.
i need to have my plan done by wednsday. i am in trouble. please and thank you. Exclamation Exclamation
Sad BooHoo Sad

EDIT:::::
actually by infinite i mean that for example the score will always add 1 say every 4 miliseconds. ok for that i would delay but how would i make it that
it will keep on adding and never stop because technically it shouldnt stop until you get hit. also should i use array to make it that ALOT (maybe not infinite but u no what i mean) objects appear on the screen, im thinking that so the objects would always be in different places i would use rand int and make limitations to how close each obstacle can be. So im not really sure how to make a collision but is there a way to make it that the higher the score the closer the objects willl be to eachother? anyways thanks for replying and stuff guys.
Display posts from previous:   
   Index -> Programming, Turing -> Turing Help
View previous topic Tell A FriendPrintable versionDownload TopicSubscribe to this topicPrivate MessagesRefresh page View next topic

Page 1 of 1  [ 9 Posts ]
Jump to:   


Style:  
Search: