Hiroki Takizawa, an employee of Preferred Networks, has conducted research and successfully achieved a weak solution for the popular board game, Othello. Othello offers a staggering 1,058 possible configurations, which proved to be too numerous for a comprehensive calculation. Takizawa managed to compute all possible configurations when there were only 36 moves remaining, utilizing the supercomputer of his company. Furthermore, he attempted to find all potential outcomes when there were 50 moves left, by creating a simulated script where he played as a skilled player, striving to discover the best possible outcome.
It should be noted that the process of selecting moves in this research remained a speculative endeavor, based on the potential and possibly optimal moves available. Not all configurations have been tested in real gameplay. Consequently, many readers express doubt regarding the sufficiency of this partially based selection process to confirm consistent and unbiased gaming results.
In an example of an initial game state presented by Takizawa, both players make no mistakes, leading to a draw in all possible scenarios.
TLDR: Hiroki Takizawa from Preferred Networks has weakly solved the board game Othello, finding all possible configurations when there were 36 moves left and exploring optimal outcomes with 50 moves remaining. The process of move selection is yet untested, raising questions about the accuracy of the results. In one example, no mistakes were made by either player, resulting in a draw.