Friday 4th March, 2016
5:00pm to 5:45pm
So this one day, I am playing the board game Quarto with my friend and I wonder, can this game end in a tie, or is there always a winner? Normal people might have squabbled or shrugged, but not us nerds! We obviously abandoned the game, took our laptops to the local pub and started hacking. In this talk I will explain how I used F# to transform this problem to satisfiability, ran it through a SAT solver to discover if it can indeed end in a tie. I will also show how to apply the same technique to more useful problems such as scheduling and code breaking.
Assistant Professor at @serg_delft. I like programming, public speaking, spreadsheets, running, software research, lindyhop, Lego Mindstorms, gaming and movies. bio from Twitter
Sign in to add slides, notes or videos to this session