Search results

Jump to navigation Jump to search
  • ...re]] for organizing points in a k-dimensional space. kd-trees are a useful data structure for several applications, such as searches involving a multidimen ...cture use for ''k''-nearest neighbours searching in [[Dynamic Clustering]] data logging algorithms. Currently, the most popular type of kd-tree in Robocode
    4 KB (638 words) - 18:54, 4 October 2013
  • ...ituation. When several attributes are combined, it is then called a [[Data Point]]. ...he [[wikipedia:k-nearest neighbours|k-nearest neighbours]] of the recorded data points and then calculating the [[wikipedia:kernel density estimation|kerne
    908 bytes (113 words) - 06:33, 15 September 2017
  • A crazy idea I had to add extra data to the regular surfing stats, by marking places on waves where you know the ...ite impossible to be implemented in a useful way, there is just too little data. --[[User:Rednaxela|Rednaxela]] 13:43, 13 April 2009 (UTC)
    4 KB (668 words) - 19:39, 13 April 2009
  • ...being fired every tick. If the rating for the Main Gun is above a certain point, there is a bias against selecting the AntiSurfer gun when comparing rating The Main Gun uses firing and non-firing waves to collect data. The non-firing waves are weighted less, but since this gun is generally ge
    12 KB (1,406 words) - 22:52, 22 April 2009
  • Currently my version of the algorithm segments data by velocity (so if a robot is still, we predict one displacement. If it is For the purpose of data collection, each observed enemy location is stored along with a timestamp.
    4 KB (630 words) - 08:14, 21 November 2007
  • ...hting of main stat buffers is dependent on amount of data in them, up to a point. (Previously, they were weighted equally no matter what.) ** Data saving is off, so as to better compare to [[Ascendant/RRGC|AscendantRRGC]]
    4 KB (662 words) - 21:11, 7 May 2009
  • ...or]] stored for that point. The locations and GuessFactor values for these data points were evolved using [[wikipedia:Genetic algorithm|genetic algorithms]
    3 KB (427 words) - 20:15, 10 August 2017
  • ...architectures based loosely on brain and used both in Machine Learning and Data Mining. boolean hitWhenGoing = true;//Did we hit a bullet while going to that point?
    9 KB (1,037 words) - 20:11, 11 August 2017
  • ...example, it sometimes drives past and then reverses into the lowest danger point if that helps is get to a low-danger area on the next wave. The danger comp Aiming/movement data between rounds, nothing between matches.
    3 KB (472 words) - 23:28, 9 January 2024
  • ===== Data analysis ===== ...ercepted), enemy change velocity sign and Tomcat's distance to destination point is less than stop distance + 8.<br>
    6 KB (842 words) - 21:25, 9 August 2017
  • ...sifies that data on-the-fly, because it's always re-examining the original data. === Translating to data points ===
    14 KB (2,154 words) - 17:24, 22 November 2013
  • ...extbook won't work. The time you have needs to be split between collecting data and generating firing angles. ...en you have no data, when you have 50 ticks, 500 ticks, or 20,000 ticks of data, your algorithm has to perform well and remain fast.
    4 KB (587 words) - 01:16, 28 August 2017
  • ** rev0073 - Accidentally included experimentally turning '''off''' culling data points via displacement vectors. ** rev0073b - Turned point culling back on. {{RumbleStatsDefault|link=http://darkcanuck.net/rumble/Rat
    6 KB (964 words) - 00:27, 17 July 2012
  • : Surfing and pattern matching data between rounds, nothing between matches. : I'm not sure! The gun is a weak point, but it's hard to find code size to make it better.
    2 KB (228 words) - 04:45, 19 January 2024
  • :AbsoluteBearing takes the angle to a point from the source. ...ty = (enemyVelocity * Math.sin(e.getHeadingRadians() - absBearing));//Some data
    7 KB (765 words) - 14:19, 11 August 2017
  • ...ns based on imperfect data. It assigns a 'goodness' score for the 'perfect data' indicating something, and then picks the best score - that sounds like fuz ...echnique, but I don't see how slicing up the guess factor / bearing offset data more finely affects learning speed. Higher segmentation, definitely, but n
    6 KB (1,054 words) - 19:14, 1 April 2011
  • ...'s basically a normal linear targeting but also gets another velocity data point when it fires (at "max gun heat") then just divides those two velocities in
    2 KB (276 words) - 07:29, 26 November 2023
  • : Between rounds: KdTree movement data. KdTree firing data. : Not to that point in development yet.
    3 KB (477 words) - 09:17, 14 September 2017
  • ...and to directly "surf" the [[Guess Factor]] data. It makes up guess factor data for the HOT, Linear and Circular predicted bullets, and basically does a si It searches only 37 points from an (-8..8, -8..8) square. The point are (successive diamond shapes where manhattan distance = {0, 4, 8, 12}, an
    5 KB (665 words) - 07:23, 15 June 2009
  • <!-- !!!!!!!!!!!!!!! NO CONFIGURATION BEYOND THIS POINT !!!!!!!!!!!!!!!!!!!! --> Bonus, it includes those in the data folder aswell. -->
    6 KB (741 words) - 02:09, 30 August 2011
  • ...t destination point based on a danger function. (Enemy [[Virtual Bullets]] data (assumes enemies are firing at it with basic methods such a [[HOT]]), dista ...[[Linear Targeting]], or [[Circular Targeting]]) are a factor in its path-point danger function ([[Minimum Risk Movement]]).
    4 KB (530 words) - 00:21, 5 June 2019
  • ...finer as more data is collected (Dynamic Segmentation). By segmenting this data by velocity and heading if the target appears to be not traveling perpendic ...attlefield so that the enemy has a heading of 0, only changing my relative point. I then calculate the best angle based on that, and reverse the process to
    7 KB (1,169 words) - 10:37, 10 May 2010
  • ...I created a system to benchmark a gun's accuracy using pre-gathered battle data. This can take the place of running a zillion Robocode battles. ...gh our targeting algorithms. Testing classification algorithms against raw data sets is nothing new or special, but it's about time someone set up a solid
    11 KB (1,670 words) - 19:28, 4 February 2017
  • ...s easier (finding your distance from an enemy or from the enemy to another point, projecting points from the enemy's location, etc) than if you had a Point2 == The Point-Generating Function ==
    12 KB (2,139 words) - 22:04, 9 August 2017
  • ...ore battles against an enemy. Here's a way to limit the size of your saved data files: ...g the curve or calculate kernel densities or whatever before acting on the data in your stat buffers. It also keeps your stat files no bigger than necessar
    5 KB (654 words) - 04:27, 15 September 2017
  • ...the enemy. You can imagine the wave as a circle that radiates out from the point from which it was fired (which is where the name came from). Once the wave ...ffsets from [[head-on targeting]]. This makes waves the ideal mechanic for data collection. In [[Wave Surfing]], waves can be used to figure out how the en
    2 KB (370 words) - 00:23, 19 August 2009
  • ...o take the array of data and scheme, so that it can be extended to analyze data from other bots. ...so a finite number of buckets can be used to take any cross-section of the data).
    10 KB (1,503 words) - 23:30, 4 April 2011
  • ...a [[Visit Count Stats|VCS]] system, and the gun with the highest expected point yield is chosen. : Nothing between matches. Between rounds all targeting data is saved.
    2 KB (331 words) - 19:09, 23 August 2012
  • ...hat are still reachable, not from all of them. Add in the discrepancies in data analysis (what you segment on, how fast you roll your stats) and it's very ...an handle, I have little experience with where Robocode shuts a bot off on data processing for a turn) meaning that by symmetry I could fire at an opponent
    9 KB (1,596 words) - 18:07, 16 May 2012
  • :* Constructing and using auxiliary data classes (<code>Point</code> and <code>RobotColors</code>).
    3 KB (363 words) - 04:15, 16 October 2017
  • ** Implement some sane gun data management to replace the borked code I had before. ...t; select a new point only if it is 10% safer than the current destination point.
    7 KB (872 words) - 06:37, 2 July 2012
  • ==== Data Generation ==== ...heading, lateral direction, advancing velocity and angle from enemy. This data will be used later for determining attributes that the stats system will us
    23 KB (3,831 words) - 23:31, 28 August 2017
  • ...'s basically a normal linear targeting but also gets another velocity data point when it fires (at "max gun heat") then just divides those two velocities in
    3 KB (398 words) - 16:48, 25 November 2023
  • ...oRunner itself should work fine if you install some copies of Robocode and point to them in roborunner.properties. * arg to clear .data dirs before starting
    4 KB (637 words) - 16:38, 24 January 2023
  • ...cts that distance for every direction it could go in and moves to the best point. : I needed a gun that would be accurate at close ranges without needing much data to operate with, so it uses a gun from the [[Circular Targeting]] page that
    3 KB (477 words) - 16:41, 2 May 2020
  • * I saw the point why it perform worse agaist some GF bot, my segmentation on movetime and ac ...ook at other people source code and I realized that I have too much recent data! So, by now, it 15.
    5 KB (769 words) - 13:34, 17 June 2009
  • : A form of [[Minimum Risk Movement]]. It has a bit of a unique point-choosing method, don't know if this does any good. It factors a "Will I hit ...etween rounds, full movement logs of enemies and the kd-tree indexing that data.
    3 KB (472 words) - 04:21, 1 August 2017
  • About the strange results, did you clean both DT's data files before your test? I just ran a 500 round battle, Tron 1.5 won, DT 1.6 Just like to point out something to you - Tron 2 is outstanding! -- [[Kawigi]]
    12 KB (2,137 words) - 22:29, 7 September 2017
  • ** Re-enabled data saving. ** Data saving in gun is disabled. (This was a mistake, but I'll let it go and chan
    41 KB (6,118 words) - 20:53, 20 May 2009
  • ...Different tree sizes and values of K are used to approximate the effect of data decay. : I would like to point out an exception, though. My [[Bullet Shielding]] code was strongly influen
    4 KB (585 words) - 16:31, 7 September 2017
  • ...cal symbols could be linked one to the next using a linked list or similar data structure like so: *Add it to the string (or other data structure) just like you would in flat pattern matching.
    7 KB (975 words) - 21:53, 12 June 2012
  • ...re is a robot that only uses bullet shielding. It provides an interesting point of reference for the technique, and also serves as a base for the bullet sh ...nd CPU Utilization painting to allow graph to be resized, fix a bug in the data end points, and allow CPU constant to be graphed.
    7 KB (1,019 words) - 07:56, 15 March 2013
  • * I haven't event touched the movement from 1.1.1 until this point, which is cool. ...and increasing relevance, making recent data to be "counted more" than old data.
    14 KB (2,195 words) - 15:39, 7 September 2017
  • ...ger UI is being built using Skotty's existing Swing codebase as a starting point. This means some of the background code may not be entirely clean or relev ...en results summary windows and reopen them, such that they pull the latest data from the RoboRunner score log files. Also, RoboJogger calculates confidenc
    16 KB (2,520 words) - 08:05, 11 March 2013
  • * This is a sample version only. Change the data to match your server's Now point your browser to http://localhost/rumble and you should be able to see your
    5 KB (786 words) - 15:04, 29 December 2009
  • ** Undo targeting point reduction. ** If there is no enemy targeting data, dodge HOT bullets.
    14 KB (1,860 words) - 16:55, 31 October 2017
  • //The list of data we store our enemy's movements in. //We don't want to aim at a point outside the battlefield, do we?
    14 KB (1,826 words) - 23:13, 3 September 2017
  • ...you won't be successful with a hit rate of less than maybe 25-30% at this point. :* A Risk Function - Determines how good or bad a point is to go to.
    26 KB (4,651 words) - 21:22, 9 August 2017
  • ...ch is to fire fast bullets when there's uncertainty and slow ones when the data indicates a better chance of hitting. Also the fudge factor was far too sma ...e of influence on which segments are trusted more, regardless of how their data looks.
    7 KB (1,032 words) - 18:10, 19 March 2010
  • ...ver time, but now there is no special advantage given to a bot which saves data between battles. ...ring scoring perfection, PL measuring pure winning ability. I should also point out that PL is actually a Condorcet method ([http://en.wikipedia.org/wiki/C
    7 KB (1,222 words) - 21:12, 26 August 2011
  • ...; it has already advanced by its velocity from that location; and the last data the enemy saw before turning his gun for this bullet is from two ticks ago === Collecting data from your waves ===
    24 KB (3,194 words) - 15:18, 7 April 2020
  • ...finite & fixed set of movements. Once the specific movement is determined, data points are iid. Then either some offline learning, online learning or a mix ...ional targeting against surfers is that all observations are biased (since data points aren't iid at all). Using hit/collide waves? Biased. Using tick wave
    7 KB (1,171 words) - 03:15, 29 June 2021
  • * Add multiple tree views to surfing to try to get more diverse data (from a non-concave search space) * Fix off-by-1 bug for enemy data collection in surfing
    20 KB (2,947 words) - 23:39, 8 March 2019
  • ...he enemy bullet by one frame, then do the following calculations with that data. That will get your gun ready before it's time to fire it. On the frame whe .... Either way it's some simple trigonometry to find the coordinates of this point. Use a bullet power of 0.15, because you will need to adjust it later.
    6 KB (1,061 words) - 21:45, 17 April 2019
  • * adaptive data views weighting in gun removed * data analysis refactored
    31 KB (3,978 words) - 10:57, 6 July 2012
  • ...weights multiplying the features. However, it can work better to write out data from your bot using something like [[WaveSim]] and then ''learn'' the embed # Point the gun towards the argmax GuessFactor of this distribution.
    11 KB (1,723 words) - 19:55, 11 January 2024
  • ...one. Saves bytes and makes for a less stubborn behaviour when fighting at point blank range. ...nts (couldn't fit more since the gun is heavily segmented). Obviously this data didn't make any difference at all.
    17 KB (2,462 words) - 21:35, 29 May 2009
  • ...Still avoids both HOT and Linear by default, until there's enough adaptive data. ** Borrow [[Diamond]]'s 1v1 fire power selection, as a simple starting point
    10 KB (1,341 words) - 13:12, 25 June 2021
  • ** Added hooks for a data integrity script I'm running to fix bad pairing data (from old uploads circa 2009) * [[Darkcanuck/RRServer/Query | New query API]] for apps needing to access data directly
    15 KB (2,213 words) - 22:42, 13 November 2011
  • ...he radar controls movement, gun and radar control. This is because at this point it does not know where the enemy is. The robot then spins all parts so that ...s extends the previous class, and it is built up like a tower. This allows data defined in super classes to be used in child classes. Such as as enemyAbsBe
    10 KB (1,806 words) - 02:59, 30 November 2013
  • ...ng Aristocles 58% before the bugfix and 73% after (over 500 rounds) should point to doing something right but I hate to take it for granted.<br> ...lingAverage calculation. Increased shot power by .1 over all ranges except point blank. Highly experimental release. Not much testing.<br>
    17 KB (2,647 words) - 00:29, 29 September 2017
  • ** Testing a different way of creating GF arrays from scan data that doesn't actually use clustering at all. It seems to skip more turns, b ...culated every tick. (Technically, this means that the bot doesn't consider data obtained since the wave was fired, but that shouldn't make much of a differ
    19 KB (2,889 words) - 07:07, 26 October 2009
  • ...uniform distance around it, and if any of those points are better than the point it's currently driving to, it will switch to go toward that one. This way ...for each opponent between rounds, nothing between matches. I tried to add data saving and loading, but it was too big, so I used the space I had elsewhere
    7 KB (1,117 words) - 04:40, 18 August 2017
  • ...gher values in their bins, but they would actually be giving less accurate data as the match goes on. (You kind of provide a natural weighting by not doing ...crap, did you just gain 50 rating points with one update? I thought my 30 point gain was impressive, but man... huge congrats from me! =) --[[David Alves]]
    12 KB (2,106 words) - 10:22, 1 July 2010
  • ...both worlds. It uses SegmentedData (currently 6 dimensions) and gets this data using a variant of [[Wave]]s. ...a good educated guess when PatternMatching fails (when there's not enough data in the microsegment)
    23 KB (4,020 words) - 19:15, 1 April 2011
  • ...o always seems to perform best when I turn it off and just use the minimum data comparisons. I think it just needs tweaking, because it should be so much m ...gun is set up so that I can tweak all sorts of parameters for the value of data, as well as the value of the individual axis (for example, segmentation on
    27 KB (4,777 words) - 04:14, 14 August 2009
  • ; '''How do I keep data from round to round and battle to battle?''' ...u have more than one copy of a robot in a battle. Note that this will save data between ''rounds'', not between ''battles''. To save between battles you wi
    23 KB (3,748 words) - 11:40, 25 October 2020
  • The key point is take advantage from the fact that the sequence is being generated increm ...ly checks all previous occurrences of the element being added. With clever data structures the algorithm can run very fast.
    8 KB (1,404 words) - 10:31, 1 July 2010
  • ...a chance when the surfing has matured. It's a fast bot and it doesn't save data. * After running 500 rounds to give the savers a chance to get data I get these results: [[FloodMini]]: 60.5%, [[Quest]]: 55.3%, [[RaikoMicro]]
    37 KB (6,790 words) - 00:33, 29 September 2017
  • ...d that his (Paul Evans) rolling average function will keep current list of data and drop old values that exceed its depth rate like a magic!). For newbie, ...imple you don't perform so well against better bots but is a good starting point. If you implement [[Circular_Targeting]] as explained in the last paragraph
    30 KB (4,702 words) - 10:27, 1 July 2010
  • ...ously existing Wave Surfing drive. This version will serve as a reference point for my next version, which will use a Wave Surfing drive of my own design. * StatDrive Flattening now auto-enables after a particular point in time if the opponent's hit ratio is over a certain threshold.
    87 KB (13,647 words) - 17:55, 8 February 2013
  • ...the '''Snapshot''' class, an immutable snapshot of a robot at a particular point in time. As of v3.0, One SnapshotHistory will be created for each robot in ...a, but some of the latest implementations let other classes handle logging data.
    28 KB (4,139 words) - 19:01, 16 April 2017
  • ...y quickly to adaptive movements. However, because it doesn't save any more data than * choose the best direction for moving to a point.
    13 KB (1,926 words) - 23:31, 3 September 2017
  • // Here we turn the robot to point upwards, and move the gun 90 degrees // Here we turn the robot to point upwards, and move the gun 90 degrees
    19 KB (3,037 words) - 13:28, 28 February 2021
  • ...ear gun can be simplified to a triangle between you, your opponent and the point of intersection, so a simple trig solution is possible. -- [[Kuuran]] ...etween you and him is just very logical, and waves are great at collecting data for that. [[DisplacementTargeting]] comes to mind as a unique idea that you
    26 KB (4,386 words) - 10:28, 1 July 2010
  • .... In the XanderCat hybrid approach, it behaves more like VCS, in that the data is logged into a factor array, and that array is surfed in the GoTo style. '''Saving Data Between Battles?'''
    50 KB (7,463 words) - 01:32, 9 April 2017
  • ** Designed a data structure that calculates average-latvel-last-n (n is arbitrary, with upper ...e chaos theory) it. E.g. Even in mid-battle (when there's already a lot of data), I can see ScalarBot often repeats the same pattern for a long time — un
    38 KB (5,304 words) - 06:59, 19 January 2023
  • ...ase: (after seeing your post in the "conflict" window) that's an excellent point. -- [[Simonton]] ...are still huge variations between guns of the same type. But I don't have data to say how much it does or doesn't matter, either. We could make a hybrid g
    33 KB (5,409 words) - 10:29, 1 July 2010
  • ...st GF gun there, I think; and who has the best PatternMatching gun at this point, [[Shadow]]? I may just start benchmarking my movement against them instead ...the file before the match, unless [[Paul Evans]] is around to create a non-data-saving version... When I get a chance, I'll do some benchmarking vs each of
    45 KB (7,402 words) - 10:29, 1 July 2010
  • ...n between them) - now the shadows are created using fireTime as a starting point instead of distanceTraveled. * Fix a bug in the goto point filtering. Goto points should now be more evenly distributed along reachabl
    71 KB (10,919 words) - 15:07, 3 October 2018
  • ...earwall' (2), ignoring the segmentation if there is not enough accumulated data. I would expect a score of about 70 in your situation. Do you evaluate whic ...ardly rolls the data at all, while the companion gun just replaces the the data in the bins as it arrives, thus rolling extremely fast if you like.) But if
    43 KB (7,787 words) - 09:48, 22 May 2009
  • ...for a mirror-distance scheme (distance to the closest "mirrored" reference point). 2.21 back, i must be missing something... faster reading data; compatible with JRE 1.3.1.<br>
    29 KB (3,966 words) - 10:31, 1 July 2010
  • == Current Data & Links == * I always thought Komarious would be a perfect reference bot, but at this point I think she's just too weak. I like CunobelinDC since it's strong and proba
    55 KB (8,332 words) - 16:27, 4 August 2009
  • ::Not out of reach, but definitely challenging. Just wanted to point how hard it is. Bleeding edge robotics technology is already achieving that :A much more feasible approach. It would even need to throw tracking data away to mimic a robocode radar scanning only in one direction. -[[User:MN|M
    44 KB (7,669 words) - 05:19, 3 October 2012
  • ** Revert Melee point generation changes. ** Re-tuned Main Gun with largest data set ever (10,000 battles), collected with Diamond's latest bullet power sch
    109 KB (14,476 words) - 04:38, 19 August 2017
  • get the data off the drive first, right?. and BuyVM, both of which I've been using for many years at this point.
    21 KB (3,345 words) - 02:28, 25 April 2020
  • ...ach bot simular to the output console but visual in nature, so we can draw data to the screen without the bots getting in the way and so on. This way we co ...what people think of this. It's even the type of thing you could add in a point release (ie, not in 1.0) without breaking anything, which is cool, since I
    30 KB (5,284 words) - 09:48, 22 May 2009
  • ...d]] is gonna destroy us at first, but we'll see. Willing to agree with the data saving, although I don't have a strong opinion either way. I know that the ...s specific idea, as I'd be up for trying some other styles of bots at some point. -- [[Voidious]]
    20 KB (3,652 words) - 00:01, 25 October 2017
  • ...use an array based list and be prepared to pay the price if you reach the point where you realise a linked list was best afterall and an array solution get Like ABC, I too use RAD-tools in combination with a DB for data persistance, while using Java mostly for connectivity to 'legacy' applicati
    24 KB (3,998 words) - 10:21, 1 July 2010