Editing Solved game (section)

==Weak-solves==
; [[English draughts]] (checkers){{Anchor|DraughtsEnglish}}
: This 8×8 variant of [[draughts]] was weakly solved on April 29, 2007, by the team of [[Jonathan Schaeffer]]. From the standard starting position, both players can guarantee a draw with perfect play.<ref>{{cite journal | title=Checkers Is Solved | date=2007-07-19 | journal=Science | first=Jonathan | last=Schaeffer| volume=317 | issue=5844 | pages=1518–22 | doi=10.1126/science.1144079 | pmid=17641166 | bibcode=2007Sci...317.1518S | s2cid=10274228 | doi-access=free }}</ref> Checkers has a search space of 5×10<sup>20</sup> possible game positions.<ref>{{cite web | url=http://www.cs.ualberta.ca/~chinook/project/ | title=Project - Chinook - World Man-Machine Checkers Champion | access-date=2007-07-19}}</ref> The number of calculations involved was 10<sup>14</sup>, which were done over a period of 18 years. The process involved from 200 [[desktop computer]]s at its peak down to around 50.<ref>{{cite web | url=https://www.newscientist.com/article/dn12296-checkers-solved-after-years-of-number-crunching/ | title=Checkers 'solved' after years of number crunching | date=2007-07-19 | access-date=2020-12-06 | publisher=NewScientist.com news service | first=Justin | last=Mullins}}</ref>

; [[Fanorona]]
: Weakly solved by Maarten Schadd. The game is a draw.<ref name="Schadd2008">{{cite journal |author1=M.P.D. Schadd |author2=M.H.M. Winands |author3=J.W.H.M. Uiterwijk |author4=H.J. van den Herik |author5=M.H.J. Bergsma |year=2008 |title=Best Play in Fanorona leads to Draw |journal=[[New Mathematics and Natural Computation]] |volume=4 |issue=3 |pages=369–387 |url=http://schadd.com/Papers/2008FanoronaJNMNC.pdf |doi=10.1142/S1793005708001124 |access-date=2015-04-08 |archive-url=https://web.archive.org/web/20160304003200/http://schadd.com/Papers/2008FanoronaJNMNC.pdf |archive-date=2016-03-04 |url-status=dead }}</ref>

; [[Losing chess]]
: Weakly solved in 2016 as a win for White beginning with 1.&nbsp;e3.<ref name=losingchess>{{cite web |last1=Watkins |first1=Mark |title=Losing Chess: 1. e3 wins for White|url=http://magma.maths.usyd.edu.au/~watkins/LOSING_CHESS/ICGA2016.pdf |access-date=17 January 2017}}</ref>

;[[Reversi|Othello]] (Reversi)
:Weakly solved in 2023 by Hiroki Takizawa, a researcher at [[Preferred Networks]].<ref>{{cite arXiv | title=Othello is Solved | date=2023-10-30 | first=Hiroki | last=Takizawa | class=cs.AI | eprint=2310.19387
 }}</ref> From the standard starting position on an 8×8 board, a perfect play by both players will result in a draw. Othello is the largest game solved to date, with a search space of 10<sup>28</sup> possible game positions. 

; [[Pentomino]]es
: Weakly solved by H. K. Orman.<ref name=":0">Hilarie K. Orman: ''Pentominoes: A First Player Win'' in ''[http://www.msri.org/publications/books/Book29/contents.html Games of no chance]'', MSRI Publications &ndash; Volume 29, 1996, pages 339-344. Online: [http://www.msri.org/publications/books/Book29/files/orman.pdf pdf].</ref> It is a win for the first player.

; [[3D_tic-tac-toe#%22Qubic%22|Qubic]]
: Weakly solved by [[Oren Patashnik]] (1980) and [[Victor Allis]]. The first player wins.

; [[Sim (pencil game)|Sim]]
: Weakly solved: win for the second player.{{Cn|date=November 2022}}

;[[Lambs and tigers]]
:Weakly solved by Yew Jin Lim (2007). The game is a draw.<ref name=":1">Yew Jin Lim. [http://www.yewjin.com/papers/PhDThesisLimYewJin.pdf On Forward Pruning in Game-Tree Search] {{Webarchive|url=https://web.archive.org/web/20090325093223/http://www.yewjin.com/papers/PhDThesisLimYewJin.pdf |date=2009-03-25 }}. Ph.D. Thesis, [[National University of Singapore]], 2007.</ref>