Re: Problem with optimizations

[Olivier Scalbert <olivier.scalbert@algosyn.com>]

Gautier wrote:
> For your short-cut version of Is_Solved you might want to write:
> 
>         for i in Face_Index_T'range loop
>           for c in Column_T loop
>             for r in Row_T loop
>               if Cube(i)(c,r) /= Final_Position(i)(c,r) then
>                 return False;
>               end if;
> ...
> 
> Just nicer looking, probably as fast as the "unrolled" version you have. 
> Anyway, I strongly recommend adding -funroll-loops along with your -O2 
> switch. Also -fpeel-loops, -ftracer, -funswitch-loops might help.
> _________________________________________________________
> Gautier's Ada programming -- http://sf.net/users/gdemont/
> NB: For a direct answer, e-mail address on the Web site!

By the way, it seems that all the 3x3 cube position can be solved in 
less than 26 moves.
As my prog does a full search at a depth of 8 in 15 secondes, it will 
need less than 12^18*15.0 seconds (12663305403769 years)

So I should focus on the algorithm instead of the compilation flags ...
;-)