|
|
| Line 27: |
Line 27: |
| | | | |
| | == Chat == | | == 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. » <span style="font-size:0.9em;color:darkgreen;">[[User:Nat|Nat]] | [[User_talk:Nat|Talk]]</span> » 14:37, 11 March 2009 (UTC)
| + | ''See [[User_talk:Nat/SDSResearch|discussion page]]'' |
| − | | |
| − | Try RoboResearch - look on the old wiki for info. --[[User:Skilgannon|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. --[[User:Rednaxela|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. » <span style="font-size:0.9em;color:darkgreen;">[[User:Nat|Nat]] | [[User_talk:Nat|Talk]]</span> » 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 :-) --[[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? » <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 with larger log size. Anyway 0003 is faster than 0001 » <span style="font-size:0.9em;color:darkgreen;">[[User:Nat|Nat]] | [[User_talk:Nat|Talk]]</span> » 14:41, 12 March 2009 (UTC)
| |
| − | | |
| − | Do I need to publish code for each research bot? I can have them on my page in a minute, but not sure if I need, or anyone want. Note that this research have codename Astraea. All the bot is Astraea with SDSxxxx version number. (OK, at first it is a competition robot, but I can't find better, but not the best, wave surfing to plug in + it really slow so it is now a research. In fact, a entry Astraea DEV in TC2K7 fastlearning result is really a SDS0001) » <span style="font-size:0.9em;color:darkgreen;">[[User:Nat|Nat]] | [[User_talk:Nat|Talk]]</span> » 14:41, 12 March 2009 (UTC)
| |
| − | | |
| − | I'm wonder, with these incomplete result show that non-firing is better against surfer but worse against RM? But let see a complete score before. » <span style="font-size:0.9em;color:darkgreen;">[[User:Nat|Nat]] | [[User_talk:Nat|Talk]]</span> » 14:41, 12 March 2009 (UTC)
| |
