« Tech talk: Building an Open-Source Autonomous Quad-Copter | Main | Tech talk video: Empirical Sampling With Haskell »

Formally Verified Chess Endgames

On May 10 Joe Hurd gave a guest lecture at Portland State University, as part of Bart Massey's Computer Science course on Combinatorial Games. The topic of the guest lecture was "Formally Verified Endgame Tables", and Joe showed how Formal Methods can be used to prove that endgame tables used by computer chess programs are correct with respect to the laws of chess. The slides of the guest lecture are available for download.

Reader Comments (3)

Huge thanks to Joe for his most excellent talk. The students really enjoyed it. Glad to see it up here.
May 26, 2011 | Unregistered CommenterBart Massey

Great work! This is very useful concept for students. They can learn something new from this concept. I like this concept.

November 10, 2011 | Unregistered CommenterFactory Automation System

The slides are just amazing! They are truly relevant to my study at this moment so they helped me to write my essay for my class!

December 14, 2011 | Unregistered CommenterWendy Eley

PostPost a New Comment

Enter your information below to add a new comment.

My response is on my own website »
Author Email (optional):
Author URL (optional):
Some HTML allowed: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <code> <em> <i> <strike> <strong>