TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Formally Verifying Chess Endgames in HOL4 - solve chess for small values of n

13 pointsby donsalmost 14 years ago

3 comments

GFischeralmost 14 years ago
It's quite interesting for people not so interested in chess, too :) , the linked presentation ( <a href="http://www.gilith.com/research/talks/psu2011.pdf" rel="nofollow">http://www.gilith.com/research/talks/psu2011.pdf</a> ) talks about software testing and static analysis.<p>And the people at Galois seem to be making advances in applying formal methods to the real world ( <a href="http://corp.galois.com/formal-methods" rel="nofollow">http://corp.galois.com/formal-methods</a> ).
bumbledravenalmost 14 years ago
This work was done in 2005. The author's paper "Formal verification of chess endgame databases" is available at <a href="http://gilith.com/research/papers/chess.pdf" rel="nofollow">http://gilith.com/research/papers/chess.pdf</a>
gus_massaalmost 14 years ago
If you have little time, you must read at least the page 24 of the slideshow:<p><pre><code> "Quiz: Find the only winning White move."</code></pre>