blockout.net

Hi,

I\'m going to work a bit on the optimization.
I\'ll code the TransformCube() and fround() function
in SSE and add the symmetry optimization.
I plan to get a factor ~2 on OOC.



I\'ll post the code ASAP on sf.net

Thanks, now I understand better :) I was just curious to see the distribution. I plotted it without \"histogram binning\". Strange distribution near 0 ? Did you get similar results ? Avg=1076.08 Min=20 Max=13438 nbGame=100000 http://zelda38.free.fr/hitso_336B_100000.png <br><br>Post edited...

If the above are correct, here is the speed up ratio
we can expect for all mode:
Flat => 2.74286
Basic => 1.82609
Extended => 1.53991<br><br>Post edited by: jlp_38, at: 2008/02/09 22:28

I made a brute force algo to check invariant transform. If my code is correct (I\'m not sure), here is the result: (So my first supposition seems to be wrong) http://www.blockout.net/blockout2/images/p0.png => 1 orientations http://www.blockout.net/blockout2/images/p1.png => 3 orientations http://ww...

Unfortunately i don\'t have excel at home :blush: I\'m downloading it. ~8h00 of download remaining :( Lieven: Could you explain me a bit better how do you fit the Gaussian curve to the experimental data ? Do you use it to estimate the value of cc ? What is the error on cc after n tries ? Anyway, I\'...

Hi, Thank you very much for the model :) I\'m going to have a look at this stuff more in depth. I\'ll try to code this in C++ which should be a bit faster. Ok, Cleaned up the excel sheet, attached. Sorry for spamming the forum. Feel free to merge these three posts Where is there some spam ? All your...

Thanks for the info. Sounds good :)
I will have a look at that tomorrow...

I use srand(GetTickCount()+rand()*100);
instead of srand(GetTickCount());


Good ;) , to avoid this problem i use the private BL2 srand()
function which has not the problem but i can\'t post
this code. It is an essential part of the fake score detection
algo.

Avg=15544.2 Min=147 Max=121455 nbGame=1000
127min 42sec, 2028.72 cps

I managed to improve a bit the OOC eval by reintroducing the \"emergency mode\". With the following eval: holeF = -2.0f * freeDepth - 1.0f; return 0.5f * nbLines + holeF * nbHole1 + 4.5 * commonEdge - 5.0f * flatNess; The idea is to give less importance to hole when you play at the top of ...

Hi there B)

Congratulations to witek for the 2nd place in 3DMania :s_bravo:

Promising match between Fred and witek in perspective...

Result of the last code:

3x3x6 BASIC with Lieven\'s eval:
Avg=1054.5 Min=28 Max=5699 nbGame=500
0min 42sec, 12418.2 cps

On a Dual-Core AMD Opteron(tm) Processor 2218

I\'ll post changes on sf.net ASAP...

I managed to improve a bit the AITester (~15% faster). Now i think that it will be very difficult to optimize the code by classic ways. The only great improvement that can be done is to study the isometry group of each blocks and create the \"possible orientations array\" for each one. Tod...

Results for 1000 games:

Avg=7568.92 Min=219 Max=40356 nbGame=1000
115min 40sec, 1090.58 bps

OK, thanks, In fact my code was correct, it was just a bad serie. Here are temporary results: [319] Cube=10830 Avg=7285.1 [320] Cube=13196 Avg=7303.52 [321] Cube=1955 Avg=7286.91 [322] Cube=5276 Avg=7280.68 [323] Cube=8193 Avg=7283.5 [324] Cube=3482 Avg=7271.8 [325] Cube=647 Avg=7251.48 [326] Cube=2...