Difference between revisions of "User:Nat/SDSResearch"
(about fitting every segment into one charactor) |
(LinkedList is super slow) |
||
| Line 6: | Line 6: | ||
| '''Name''' || '''Author''' || '''Gun''' || '''CC''' || '''RMX''' || '''SHA''' || '''WS''' || '''WOE''' || '''Surf''' || '''DM''' || '''FT''' || '''GG''' || '''RMC''' || '''WLO''' || '''No Surf''' || '''Total''' || '''Comment''' | | '''Name''' || '''Author''' || '''Gun''' || '''CC''' || '''RMX''' || '''SHA''' || '''WS''' || '''WOE''' || '''Surf''' || '''DM''' || '''FT''' || '''GG''' || '''RMC''' || '''WLO''' || '''No Surf''' || '''Total''' || '''Comment''' | ||
|- | |- | ||
| − | | | + | | 0001 || [[Nat]] || SDS || 56.86 || 73.82 || 63.35 || 67.59 || 67.96 || '''65.92''' || 85.84 || 77.37 || 70.01 || 80.83 || 79.87 || '''78.78''' || '''72.35''' || 7.5 seasons |
| + | |||
|} | |} | ||
== Version History == | == Version History == | ||
| − | * | + | * 0001: I need to improved a lot, this version have 7 segments; log size of 1000. |
| − | + | * 0002: Change LinkedList to ArrayList, increase the segmentation length from 7 to 18, increase log size from 1,000 to 10,000. | |
=== Todo List === | === Todo List === | ||
* Make a single string contains every log. | * Make a single string contains every log. | ||
| − | * Examine what Virus does :-) | + | * <s>Examine what Virus does :-)</s> '''DONE!''' |
| + | * Make it faster | ||
| + | * | ||
* ... | * ... | ||
| Line 40: | Line 43: | ||
</pre> | </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? » <span style="font-size:0.9em;color:darkgreen;">[[User:Nat|Nat]] | [[User_talk:Nat|Talk]]</span> » 01:36, 12 March 2009 (UTC) | 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? » <span style="font-size:0.9em;color:darkgreen;">[[User:Nat|Nat]] | [[User_talk:Nat|Talk]]</span> » 01:36, 12 March 2009 (UTC) | ||
| + | |||
| + | LinkedList is super slow. I change my code to use <code>ArrayList(10100)</code> and I can increase the segment and log size a LOT (see above). Let see 0002 with larger log size. And 0003 with non-firing waves. | ||
Revision as of 15:01, 12 March 2009
Research with Symbolic Dynamic Segmentation.
Contents
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 |
| 0001 | Nat | SDS | 56.86 | 73.82 | 63.35 | 67.59 | 67.96 | 65.92 | 85.84 | 77.37 | 70.01 | 80.83 | 79.87 | 78.78 | 72.35 | 7.5 seasons |
Version History
- 0001: I need to improved a lot, this version have 7 segments; log size of 1000.
- 0002: Change LinkedList to ArrayList, increase the segmentation length from 7 to 18, increase log size from 1,000 to 10,000.
Todo List
- Make a single string contains every log.
Examine what Virus does :-)DONE!- Make it faster
- ...
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)
LinkedList is super slow. I change my code to use ArrayList(10100) and I can increase the segment and log size a LOT (see above). Let see 0002 with larger log size. And 0003 with non-firing waves.
