Board 61: Work in Progress: Teaching Logic Design with Interactive Computer Games

Abstract Sum-of-Products (SOP) expressions are two-level representations of Boolean functions consisting of an OR sum of AND terms. There exist many methods of SOP synthesis, but the Karnaugh map method is the most frequently taught in undergraduate curriculum. Unfortunately, most traditional approaches to teaching Karnaugh map-based SOP minimization are not very engaging for the learner. To increase student engagement, game-based approaches to teaching are increasingly being used to supplement traditional teaching methods. There has been limited research into extending such game-based teaching approaches towards SOP minimization with Karnaugh maps. This paper proposes a game to teach Karnaugh map-based SOP minimization. The players of the proposed learning game seek to maximize the true minterms they individually cover within the Karnaugh map through a back-and-forth turn-based model. The system consists of both a two-player version between two human players and a single-player version that involves a computer opponent in place of a second human player. This game makes learning about Karnaugh map-based SOP minimization more engaging and convenient to practice. Results found significant increases in learning retention and self-reported engagement for users of both the single and two-player versions compared to conventional teaching methods. These findings underscore the potential that incorporating game design elements into instruction can have in enhancing students' understanding of topics such as SOP minimization and Karnaugh maps. These results highlight the importance of future research investigating the educational benefits of applying game-based learning to other introductory logic design topics.