Note to users. If you're seeing this message, it means that your browser cannot find this page's style/presentation instructions -- or possibly that you are using a browser that does not support current Web standards. Find out more about why this message is appearing, and what you can do to make your experience of our site the best it can be.

Site Tools

  • AAAS
  • Subscribe
  • Feedback

Site Search

Search Advanced

Science 20 July 2007:
Vol. 317. no. 5836, pp. 308 - 309
DOI: 10.1126/science.317.5836.308a
Prev | Table of Contents | Next

News of the Week

COMPUTER SCIENCE:
Program Proves That Checkers, Perfectly Played, Is a No-Win Situation

Adrian Cho

If two players face off at checkers and neither makes a wrong move, then the game will inevitably end in a draw. That's the result of a proof executed by hundreds of computers over nearly 2 decades and reported online by Science this week (www.sciencemag.org/cgi/content/abstract/1144079).

Read the Full Text

To Advertise     Find Products

Science. ISSN 0036-8075 (print), 1095-9203 (online)