Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

I'm very surprised it's a draw. It's not like chess where it's "easy" to exchange a piece for an equal one until the board is "empty" and it's a draw. (Yes, it's more complicated. I played a lot of chess until secondary school, and it's more complicated. But trading equal pieces is a good strategy to get a draw.)

In Othello the number of pieces go up and down in weird patters, so a draw is very surprising for me.

Has anyone checked the proof?

Edit: Is Othello solved for smaller boards? Can this proof be aplied to smaller boards?



The most promising lines have long (decades) been known to result in a draw. There wasn't enough CPU power to brute force the entire search space.


Which is the bigest board that has been bruteforced?


Starting with a 1x1, 2x2, 3x3, etc board size seems like a reasonable strategy for developing an intuition of the solution.




Consider applying for YC's Winter 2027 batch! Applications are open till November 2.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: