Difference between revisions of "User:Nat/SDSResearch"

From Robowiki
Jump to navigation Jump to search
(Yep you can!)
(about fitting every segment into one charactor)
Line 26: Line 26:
  
 
RoboResearch saves battle results in a database as it goes and doesn't re-run unnecessary battles. In fact, if two different challenges have an exactly overlapping pairing it won't repeat the battles unnecessarially. Also, the GUI version (which I highly recommend) stores currently running challenges in a config file so it's super-easy to close at any time and continue running later. In summary that answer to your question is: Yes :-) --[[User:Rednaxela|Rednaxela]] 01:10, 12 March 2009 (UTC)
 
RoboResearch saves battle results in a database as it goes and doesn't re-run unnecessary battles. In fact, if two different challenges have an exactly overlapping pairing it won't repeat the battles unnecessarially. Also, the GUI version (which I highly recommend) stores currently running challenges in a config file so it's super-easy to close at any time and continue running later. In summary that answer to your question is: Yes :-) --[[User:Rednaxela|Rednaxela]] 01:10, 12 March 2009 (UTC)
 +
----
 +
If I do bit shifting to fit the data into 8-bits link this:
 +
<pre>
 +
0 0 0 0 0 0 0 0
 +
  L    D  a W
 +
  e    i  c a
 +
  t    s  c l
 +
  e    t  l l
 +
  r    a
 +
  a    n
 +
  l    c
 +
        e
 +
</pre>
 +
With this I can have up to 7 velocity segment, 7 distance segment, 2 acceleration segment and 2 wall segment. It can fit every segment into one character. Do anyone have idea how to cut the string as per SDS? Or just <code>char & 0xFE</code> or <code>0xE0</code>? One more, what is faster, doing kernel density or log it to an array and find max? &raquo; <span style="font-size:0.9em;color:darkgreen;">[[User:Nat|Nat]] | [[User_talk:Nat|Talk]]</span> &raquo; 01:36, 12 March 2009 (UTC)

Revision as of 02:36, 12 March 2009

Research with Symbolic Dynamic Segmentation.

Challenge Result

Targeting Challenge Y2K7 Fast Learning

Name Author Gun CC RMX SHA WS WOE Surf DM FT GG RMC WLO No Surf Total Comment
SDSResearch 0001 Nat SDS 57.0 65.0 65.0 67.0 60.0 62.8 84.0 70.5 68.5 76.0 80.0 75.5 72.3 54 seasons

Version History

  • SDSResearch 0001
    • I need to improved a lot, this version have 7 segments; log size of 1000.

Todo List

  • Make a single string contains every log.
  • Examine what Virus does :-)
  • ...

Chat

Help, does anyone have a TC calculator? The score above is just a roughly averaged by eyes score. I think the actual is much lower except the Total score, that was calculated with ScoreAveragedAddOns / 350. I know that the surf score is invalid. » Nat | Talk » 14:37, 11 March 2009 (UTC)

Try RoboResearch - look on the old wiki for info. --Skilgannon 15:28, 11 March 2009 (UTC)

Actually, don't look on the old wiki for RoboResearch, the new wiki page is more recently updated I believe. But yes, RoboResearch is very nice, it automates running all the battles, calculating the scores, and even generating the table row in mediawiki syntax :D (actually, challenges pages really should state to use RoboResearch). With the GUI version you can queue up multiple versions to test one after the other as you sleep too. --Rednaxela 15:36, 11 March 2009 (UTC)

I usually don't download everything that I need to check out from SVN repository by my self :) I took an hour to find download link for RoboResearch and at last admit that I must checkout them from SVN. Question: Can I pause the challenge and resume it next time I turn on my computer? I am not allow to turn on computer while I'm sleeping. » Nat | Talk » 00:53, 12 March 2009 (UTC)

RoboResearch saves battle results in a database as it goes and doesn't re-run unnecessary battles. In fact, if two different challenges have an exactly overlapping pairing it won't repeat the battles unnecessarially. Also, the GUI version (which I highly recommend) stores currently running challenges in a config file so it's super-easy to close at any time and continue running later. In summary that answer to your question is: Yes :-) --Rednaxela 01:10, 12 March 2009 (UTC)


If I do bit shifting to fit the data into 8-bits link this:

0 0 0 0 0 0 0 0
  L     D   a W 
  e     i   c a
  t     s   c l
  e     t   l l
  r     a
  a     n
  l     c
        e

With this I can have up to 7 velocity segment, 7 distance segment, 2 acceleration segment and 2 wall segment. It can fit every segment into one character. Do anyone have idea how to cut the string as per SDS? Or just char & 0xFE or 0xE0? One more, what is faster, doing kernel density or log it to an array and find max? » Nat | Talk » 01:36, 12 March 2009 (UTC)