NebiyuReversi problem

[Mark]

A little off topic here, but have you thought about trying to solve 8x8 othello with Edax and current hardware? Thanks!

I am afraid Edax or my computer is too slow...
The best Edax reached is (after the move F5) :

Code: Select all

59@87%  +00  4:23:23:56.78 43654107405796 101559729  D6 c4 D3 c3 F4 c5 B3 c2 B4 e3 E6 c6 F6 a5 A4 b5 A6 d7 C7 e7 E8 b6 D8 g3 F7 g5 D1 c1 B1 g6 A7 g8 H6 h5 F8 c8 H4 g4 B2 a1 B7 e1 H3 g7 D2 e2 F2 a2 H8 f3 F1 h7 A3 a8 B8 g1 G2 h1 H2

with Edax last version (4.2.1), on a i7 2600k, compiled with icc 12.1 under Linux Ubuntu, ie a faster compiled version than the binary available for download.
The meaning of the line is <depth>@<probcut selectivity level> <score> <time> <nodes> <speed> <PV>. Edax uses Iterative deepening and then iterative & diminishing selectivity, using the percentage 73, 87, 95, 98 and 100%. 100% means no selectivity.
After more than 20 days, Edax was not able to reach the next level 59@95%, and I had to abort the search. So, I have no idea how long it will take to solve Othello with Edax, is it 1 year (optimistic) or 100 years ?

Even if Edax was able to solve Othello, I am not sure that its result will be mathematically accepted as there are possible transposition table collisions.

Yes, a formal proof of a solution would require a lot of work. You'd probably have to break it down by making some number of initial moves and then solving each of those positions individually. Anyway, it would be quite an accomplishment!