User talk:Tmservo
package Josewong;
import robocode.*;
//import java.awt.Color;
// API help : http://robocode.sourceforge.net/docs/robocode/robocode/Robot.html
/**
* Invertigo - a robot by (your name here)
*/
public class Invertigo extends Robot
{
/**
* run: Invertigo's default behavior
*/
public void run() {
// Initialization of the robot should be put here
// After trying out your robot, try uncommenting the import at the top,
// and the next line:
// setColors(Color.red,Color.blue,Color.green); // body,gun,radar
// Robot main loop
while(true) {
// Replace the next 4 lines with any behavior you would like
back(100);
turnGunLeft(360);
ahead(100);
turnGunLeft(360);
}
}
/**
* onScannedRobot: What to do when you see another robot
*/
public void onScannedRobot(ScannedRobotEvent e) {
// Replace the next line with any behavior you would like
fire(0.95);
}
/**
* onHitByBullet: What to do when you're hit by a bullet
*/
public void onHitByBullet(HitByBulletEvent e) {
// Replace the next line with any behavior you would like
ahead(10);
}
/**
* onHitWall: What to do when you hit a wall
*/
public void onHitWall(HitWallEvent e) {
// Replace the next line with any behavior you would like
ahead(20);
}
}
package Josewong;
import robocode.*;
// API help : http://robocode.sourceforge.net/docs/robocode/robocode/JuniorRobot.html
/**
* InvertigoJunior - a robot by (your name here)
*/
public class InvertigoJunior extends JuniorRobot
{
/**
* run: InvertigoJunior's default behavior
*/
public void run() {
// Initialization of the robot should be put here
// Some color codes: blue, yellow, black, white, red, pink, brown, grey, orange...
// Sets these colors (robot parts): body, gun, radar, bullet, scan_arc
setColors(orange, blue, white, yellow, black);
// Robot main loop
while(true) {
// Replace the next 4 lines with any behavior you would like
back(100);
turnGunLeft(360);
ahead(100);
turnGunLeft(360);
}
}
/**
* onScannedRobot: What to do when you see another robot
*/
public void onScannedRobot() {
// Replace the next line with any behavior you would like
fire(0.95);
}
/**
* onHitByBullet: What to do when you're hit by a bullet
*/
public void onHitByBullet() {
// Replace the next line with any behavior you would like
ahead(10);
}
/**
* onHitWall: What to do when you hit a wall
*/
public void onHitWall() {
// Replace the next line with any behavior you would like
ahead(20);
}
}
I am actually Josewong from wikia My name is Augustus Joseph Wong and my location is 7129 Beverly Street, 66204,
- [View source↑]
- [History↑]
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.
Contents
Thread title | Replies | Last modified |
---|---|---|
Roborumble Participants | 0 | 22:12, 4 April 2015 |
Did anyone have trouble logging in | 3 | 01:21, 29 October 2014 |
Best Beginner MegaBot Contest | 1 | 22:43, 17 September 2014 |
Wiki postings | 6 | 18:01, 22 July 2014 |
here's a warning | 0 | 15:28, 20 March 2014 |
literumble needs update | 14 | 00:42, 18 March 2014 |
kms.golden vs basicgfsurfer | 1 | 04:28, 19 December 2013 |
FoilistMicro vs EpeeistMicro | 1 | 02:04, 19 December 2013 |
dcbot targeting or gftargetingbot targeting | 2 | 23:43, 18 December 2013 |
java file multiple class files | 1 | 07:25, 18 December 2013 |
how do i post source code | 1 | 03:05, 16 December 2013 |
best robot exactly ten lines | 4 | 06:18, 14 December 2013 |
how to make a X-tree | 1 | 02:54, 12 December 2013 |
best guessfactor place | 1 | 01:54, 12 December 2013 |
pattern surfer | 0 | 01:53, 5 December 2013 |
proof that literumble win percentage is broken | 1 | 02:23, 30 November 2013 |
does bin smoothing make guns better or worse | 8 | 02:09, 26 November 2013 |
netbeans vs eclipse | 1 | 13:24, 23 November 2013 |
AW's kd-tree | 15 | 23:38, 14 October 2013 |
Skilgannon's kd-tree | 30 | 19:43, 11 October 2013 |
First page |
Previous page |
Next page |
Last page |
Because RoboWiki Forcibly logged me off and wouldn't let me log in until this day Did anyone else have that same problem
From Oct 19th to 24th, the server had an out of disk space condition. That was causing failed logins among other things. That's fixed now.
Rules
1: You must be a beginner with some coding experience
2: You cannot copy a bot
3: Bot must be GNU GPL any version
4: Participants must sign up now by replying to this thread
5: The winner is the person who creates the best robot
6: Benchmark robots are all 12 wiki. prefix robots including BasicGFSurfer
7: The best robot is the best scoring robot against all 12 wiki. prefix robots
8: 1v1 for all 12 wiki. prefix robots
Tmservo, your categories are not defined and thus make sense only in your head.
Who is qualified as beginner? What is the metric? Is it a time devoted to robocode or success of a typical bot from an author?
Which 12 wiki bots are you referring to? What if some one add one more wiki bot?
Is this competition 1on1 or melee?
The part about "stolen" and "permission" seems to be redundant. What if someone use one of the top bots distributed with permissive license? Are they good to participate?
Please don't think that I want you to leave. I am complaining. I would like the questions (in their current form) to stop. But I'd also like a new member of the community. The following are my suggestions for how to ask questions on the robowiki:
1) Make sure your question is closely related to Robocode. It can be about algorithms that are not specific to Robocode, but it should be about the algorithms as applied to Robocode.
2) Make sure you punctuate your questions. It's not hard. Furthermore, it makes them easier to read.
3) Make sure you pay attention to the answers you receive. Read them before replying.
4) Make sure you thank people for helping you. We are all busy and have other things to do.
5) Make sure you have some understanding of the subject about which you are asking. If you don't, answering your questions isn't worth our time.
6) Make sure you search for an answer to the question before asking it. Use the search box in the left and/or google unless you know the information isn't easily available.
I'm glad you are interested in what I found to be the best way to learn programming, but I think that following the above guidelines will help you to learn.
Do you have any questions? Ask away.
Yep, I'm a jerk.
Punctuation error: "If you don't answering your questions isn't worth our time." Comma should be added after don't
As am I.
"Make sure your question is closely related to [Robocode]. It can be about algorithms that are not specific to [Robocode], but [it] should be about the algorithms as applied to [Robocode]."
Tmservo,
literumble needs your CPU cycles and not update. There is only one person who is currently donating CPU cycles to battle runs, no wonder there are almost no updates. [1]
P.S. Tmservo, it is hard to read a mind of a person. Please, add description/words to your posts, not just links or pictures.
i meant update via RoboRumble client and i need A Robocode 1.8.2.0 because i Updated to 1.8.3.0 a long time ago P.S what version do you use beaming
I use 1.8.2.0 since it the latest from which rumble accept stats.
I would prefer 1.7.3.0 since it seems to have a faster graphics in comparison to newer versions and I like to use for my internal program/debug/observe cycle.
If you go to the rumble statistic page you will see: Allowed Robocode versions: ['1.8.1.0', '1.8.2.0']
The reason only 1.8.1.0 and 1.8.2.0 are allowed is because they both have a bug which affects the scores, giving top bots a slightly lower score. If we want to switch to new versions we will have to delete all data and start fresh, because new versions fix the bug.
I think it is better to allow newer version to participate and to regenerate stats. It might boost number of contributors.
Robocode is hard enough to start. Not everyone will have enough patience to see that it requires older version for rumble. Besides it is better to debug/prototype a bot with the same version of robocode and rumble.
Suggestion about switching to newer versions.
If literumble kept separate average scores for each version on each pairing, it could support multiple versions at the same time.
And, maybe, using the version of the last upload on each pairing as the main version. Contributors could gradually upgrade their clients without need to reset the whole database.
Unused old version stats could be deleted after some time to free space.
These "which is better" questions for seemingly random bots aren't good questions. Besides, if you want to know I suggest you just check the comparison page on the roborumble server instead of making a thread here. If you have a question about a bot that's fine, but "which is better" is not a very useful question and you can get your answer on your own like from the link above.
Generally, Dynamic Clustering is better than traditional GFT. However, DC also requires more codesize. I had to cut the gun down to three dimensions, instead of EpeeistMicro's five segments. I also had to cut back the movement mode selection, energy management, and anti-ram behavior.
You're probably referring to what happens when one defines nested/inner/anonymous classes inside another class's java source file.
Perhaps if you included reasons in more of your questions, you would get more responses. As it is, you seem to be asking rather arbitrary questions to which the answers seem irrelevant.
Who knows? Not all bots are open source, and I agree with straw that this is not really relevant.
Given that new line characters in Java are optional, this robot is better than DrussGT. Also, I think that the "no free lunch theorem" rather limits what can be postulated of said hypothetical robot. But seriously, I'm finding your questions rather annoying. Could you please try using punctuation, multiple sentences, and acknowledging that you understand what we tell you?
Also, questions like "How do I make an X-tree?" don't really belong here. This isn't a general programming forum, and if you can't understand it by using google, you probably need to spend more time increasing your coding skills rather than asking what the best ______ in robocode is. I know we try to be welcoming on the robowiki, and people were very patient with me, but I think it seems like you need to learn more programming before you should worry about most of the questions you are asking. In fact, I'd say learning more programming would make it so you would never ask this question.
I don't mean to scare you away, but some of your questions seem to indicate that you need to learn more about programming. If you have questions about why the GF tutorial does certain things, then please ask them. If you're wondering how to write a priority R tree, then I don't think we'll have the time to help you.
Adding on, try not to be demanding in your questions... "Somebody answer this" or "Why won't anybody post a reply" are not really relevant. Responses usually take hours or even days to come. Be patient. This is also in the wiki postings thread.
And me being 10 minutes after AW is a coincidence.
And I HAD no programming skills earlier. I'm currently still a Robocode Noob and learning java.
how do i make a X-tree http://en.wikipedia.org/wiki/X-tree
Is that even robocode?
Most top bots use DC in their movement.
As for guns, Tomcat is the best bot without DC but does not use GF. XanderCat is the best bot with a GF gun but has multiple guns to go with it(it's not completely GF). The best bot with a single GF gun that I know of is WaveSerpent(Gilgalad has 2 GF guns).
By the way... you could have easily found out yourself. Look at the bots wiki pages.
In movement, Bin Smoothing helps bots dodge bullets with a margin of safety.
In radar, why would you use bins?
In guns, Bin Smoothing helps spot crowds in melee/team if combined with swarm targeting. In 1v1 I don't see any use.
@MN and Skilgannon: While those things are true, I think those descriptions miss the underlying point of why bin smoothing is helpful. In both targeting and dodging, what one is trying to do is to estimate the PDF (probability density function) curve of the opponent's movement/targeting. Whenever one is estimating a PDF curve (not just in Robocode) from a finite number of observations, and the system has some inherent noise or unpredictability, it will give a more accurate estimation of the true PDF curve if one applies the correct amount of smoothing. Now, how much is the "correct amount" is a complicated question that depends on how much noise/uncertainty your measurements have, how much noise/uncertainty the process being measured has, and how many measurements you have (reminds me of Kalman filters, similar principals come into play). In Robocode most people just pick a certain amount of bin smoothing that seems to work for them, but I feel it is worth pointing out that this is just one application of PDF curve estimation, and that there are methods of estimating the correct amount of smoothing which to my knowledge have not yet been applied to Robocode. (I'd guess you two already are well aware of this, but I just feel like rambling)
Instead of applying methods of estimating the correct amounts of bin smoothing, people tend to switch to kernel density and tune the kernel function. There was a lot of discussion about the best kernel function and the best function width. The optimal changes for each opponent and some kind of averaging is needed, which is usually estimated through genetic tuning.
In guns, smoothing usually has no effect because you don't need to estimate the PDF, you only need to find the peak. But when you superpose many PDFs together (swarm targeting), things change.
Estimating the PDF can still a useful component of finding the peak when not superimposing things, particular when the density of observations is sufficiently low. The main reasons you don't see much effect in targeting is that the usual bin sizes inherently act similar to a certain amount of smoothing anyway, and for targeting you have a larger number of observations than movement which reduces the amount of smoothing that makes sense as well. Consider what happens when your bins are significantly smaller than what is typical without any additional smoothing. (A targeting system that accounts for botwidth also reduces the amount of smoothing that makes sense, but that's a bit of a different matter)
For me two things make smoothing more useful in movement than in targeting:
- Movement needs to estimate probability at arbitrary points, instead of a single peak, so the location the probability is required at isn't related to where data is available.
- Movement has much less data than targeting, so smoothing is needed to fill in gaps in knowledge.
Theoretically smoothing might help in targeting, but all my testing has shown that a simple square kernel works just as well or better, while running many times faster.
I've also considered something like Kalman filters, but they are Unimodal which doesn't work for targeting or movement at all. Perhaps particle filters, although the histogram filters we have right now in VCS also work pretty well.
re: why in movement, agreed 100%.
With WaveSim, I've tested different kernel densities (effectively smoothing formulas) in my main gun over a huge data set. There were differences, but IIRC on the order of thousandths of a percent in hit percentage (eg 12.004% vs 12.002%). Not sure of the margin of error, either... 5k battles * ~25k ticks = millions of records, and both algorithms were running on the same data set.
I use Eclipse. I don't use NetBeans in years, so I can't really compare the new versions against each other.
But in general terms, most of Eclipse features are based on plug-ins, which means you won't find all the features you need on the basic installation, but there should be a plug-in somewhere doing what you need. NetBeans is a fixed pack, if it has everything you need then it's fine, if not, then you will need additional tools outside NetBeans.
I suggest you stop worrying about how fast a particular kd-tree is and just use one of them. The top few kd-trees are all very similar in performance and I am sure each have their pro's and cons. I personally still use Rednaxela's Gen 2 tree because of how self contained it is (vs his Gen 3 which has more structure).
If you were using it for Robocode I don't think you'd be worrying about which one. What are you using the tree for?
The tree that I have, is approximately as fast as rednaxela's 2nd gen. (slightly faster in my tests). Are you trying to write a kd-tree or just looking for one to use? As far as I know, jk's tree, rednaxela's tree, and my tree are all quite similar. Bucket kd-tree. No recursive search methods. Use a MBR (minimum bounding rectangle). Use a heap to store the points. I think rednaxela was the first to introduce most of those ideas to robocode, but in my tests, mine was slightly faster and presumably the same can be said of JK's tests.
there is no kd-tree at http://robowiki.net/wiki/User:AW/kD-Tree but there is kd-tree inside gilgalad
Soooo, I've been staying out of this because I have nothing constructive to offer... But FYI, the fact you ignore pretty much every question someone asks makes you seem suspicious. And asking/demanding things without listening makes you seem rude.
If you'd engage in a conversation and tell us your situation, we could probably offer you a lot more help. If you're doing something shady, like cheating on homework, and that's why you're being so secretive, we probably don't want to help.
They're pretty much tied. Mine might be a little faster on systems where the data in the Kd-Tree is frequently pushed out of cache.
No, as I said above, they are mostly the same except for cache conditions.
3rd gen is the fastest of Rednaxela's trees. There's also a k-NN algorithm benchmark if you want to run some tests.
First page |
Previous page |
Next page |
Last page |