Difference between revisions of "@workgun"

From Robowiki
Jump to navigation Jump to search
(new gun)
 
Line 7: Line 7:
 
* _ shot with the best gun, create a virtual wave for GF & PM, and set the wave as "true virtual wave"
 
* _ shot with the best gun, create a virtual wave for GF & PM, and set the wave as "true virtual wave"
  
===Which data save?===(difference are calculate every tick, if one or more scan fail gun can try to estimate lost data)
+
===Which data save?===
 +
(difference are calculate every tick, if one or more scan fail gun can try to estimate lost data)
 
* enemy distance travelled bin from 0 to 8 (int)
 
* enemy distance travelled bin from 0 to 8 (int)
 
* enemy bearing change bin from 0 to 46 (int)
 
* enemy bearing change bin from 0 to 46 (int)

Revision as of 14:14, 26 February 2009

@work gun

I'm thinking about this new ibrid gun, it's work is quite simple: get and save data as PM gun, but can choose if use a PM or GF targeting algoritm.

How gun works?

  • _ get data
  • _ calculate % virtual hit on true shot using GF algorithm (at same bin distance if enought data)
  • _ calculate % virtual hit on true shot using PM algorithm (at same bin distance if enought data)
  • _ shot with the best gun, create a virtual wave for GF & PM, and set the wave as "true virtual wave"

Which data save?

(difference are calculate every tick, if one or more scan fail gun can try to estimate lost data)

  • enemy distance travelled bin from 0 to 8 (int)
  • enemy bearing change bin from 0 to 46 (int)
  • i've shot bin from 0 to 3 (int)
  • enemy has shot bin from 0 to 3 (int)
  • distance from me bin from 0 to 10 (int)
  • enemy life bin from 0 to 10 (int)

How find PM match?

  • Look for exactly same data in an Arraylist<String> (index is tick) who contains bins indexin this form: (index bin 1).(index bin 2).ecc..

if exactly match hasn't been found:

  • get all same data with same bin index
  • find the most similar results for every bin

How find similar result?

  • sum the distance of data bins index and sum it
  • find the lowest sum
  • if there are many low sum do the same but using the distance between absolute value and not bins index

I hope you have understend^^ ==lestofante 13:11, 26 February 2009 (UTC)