Report - THESHORTESTGAME OF CHINESECHECKERS ...In 1971, Octave Levenspiel found a 27-move solution [6, p. 68]. We will show that 27 moves is the shortest solution possible, and consider various

Select PornographicDefamatoryIllegal/UnlawfulSpamOther Terms Of Service ViolationFile a copyright complaint

Please pass captcha verification before submit form