User talk:Awesomeness

From Robowiki
Revision as of 03:02, 7 May 2009 by Awesomeness (talk | contribs) (Aww....)
Jump to navigation Jump to search
Archived talks:
Archived Talk 20090502 - Archived Talk 20090504

Help! I can't edit any pages because of some stupid database error! --Awesomeness 21:57, 6 May 2009 (UTC)

Hey, it works now... --Awesomeness 22:00, 6 May 2009 (UTC)

Okay, I'm almost done with the prototype of my bot. It's really big, so I'll put it here. I'm sure it has lots of problems with the antigrav movement, (just look at the console, which shows the x force and y force that the points generate) and I'm sure it doesn't work at all... However, do take a look at the debug graphics, I think they're cool. =) --Awesomeness 20:52, 4 May 2009 (UTC)

OH NO! Something I did with the antigrav code messed up the bullet sim code! Good thing I backed up the non-broken version before I added antigrav. Should I show that one instead? I can't figure out how to add antigrav, I guess I'm simply just not good enough. Oh well... =( --Awesomeness 20:58, 4 May 2009 (UTC)
Don't say that - you wouldn't believe how buggy the first version of Dookious was. =) And I had been programming for years, and had four semesters of Computer Science study under my belt. Seriously, keep at it, dude... --Voidious 21:04, 4 May 2009 (UTC)
I'm going to put the before-I-messed-it-up code on instead. --Awesomeness 22:11, 4 May 2009 (UTC)

What do you think of my targeting idea on my userpage? --Awesomeness 00:44, 7 May 2009 (UTC)

I think I've seen something like this before but I don't remember which so don't care. Now, I understand how I recorded thing to tree, but how it find the match? » Nat | Talk » 01:19, 7 May 2009 (UTC)
It would look through every branch in the tree, and it will look for matches. It simply takes the current speed, acceleration, turn rate, etc. and finds the closest match, or matches. If there are multiple branches that match, it would take the branch that occurs most. I suppose if they're even in occurence it might pick them randomly. Then again, it might balance out, choosing based on the closeness of the match and the number of occurences combined. There's lot's of ways to do it. --Awesomeness 01:50, 7 May 2009 (UTC)
OK, I think I remember which now. LambdaBot's state searching. =P » Nat | Talk » 01:55, 7 May 2009 (UTC)
It seems none of my ideas are ever new. Man! Everyone's thought of everything! Either way, I suppose mine might still be new because i'ts a targeting implementation, not movement. --Awesomeness 01:58, 7 May 2009 (UTC)
If I'd thought of it just a bit earlier, it's be my first original idea... --Awesomeness 02:02, 7 May 2009 (UTC)

You cannot post new threads to this discussion page because it has been protected from new threads, or you do not currently have permission to edit.

There are no threads on this page yet.