Recorded at Domain-Driven Design 2016, January 26-29, Brussels
Felienne is assistant professor at Delft University of Technology, where she heads the Spreadsheet Lab, researching the application of software engineering methods to spreadsheets. One of Felienne's biggest passions in life is to share enthusiasm for programming with others. She teaches a group of kids Lego Mindstorms programming every Saturday, serves on the board of Devnology, a Dutch developer community that organizes monthly meetings on all things software, and is one of the founders of the Joy of Coding conference, a one day developer conference in Rotterdam celebrating the joy and art of programming. If she is not coding, blogging and teaching, she is probably dancing Lindy Hop, out running, watching a movie or playing a (board)game.
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 real-life problems such as scheduling.