Java endgame solver semplified.
Some cleaning in Makefile and exact_solver. Added a new function in bit_works.
Added gprof files to gitignore.
Now the Java version and the C version have the same exact algorithm. The number of nodes and leafs is exactly the same.
The JAva version is 34% faster. The C version doesn't have the loop unrolling in legal moves and make move. This is the next step.
Anyhow it is amazing how similar are the performances.
The LSB1 algo is much better becouse the first move for black is the first empy (A2).
ExactSolver.java has a main function.
Loop unrolled in function board_make_move in board.c.
Added advanced_square_set module. It is dedicated to sorting the legal moves set.