Logical and psychological analysis of deductive mastermind
نویسندگان
چکیده
The paper proposes a way to analyze logical reasoning in a deductive version of the Mastermind game implemented within the Math Garden educational system. Our main goal is to derive predictions about the cognitive difficulty of game-plays, e.g., the number of steps needed for solving the logical tasks or the working memory load. Our model is based on the analytic tableaux method, known from proof theory. We associate the difficulty of the Deductive Mastermind game-items with the size of the corresponding logical tree derived by the tableau method. We discuss possible empirical hypotheses based on this model, and preliminary results that prove the relevance of our theory.
منابع مشابه
Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation
In the past three decades, deductive games have become interesting from the algorithmic point of view. Deductive games are two players zero sum games of imperfect information. The first player, called ”codemaker”, chooses a secret code and the second player, called ”codebreaker”, tries to break the secret code by making as few guesses as possible, exploiting information that is given by the cod...
متن کاملMastermind is NP-Complete
In this paper we show that the Mastermind Satisfiability Problem (MSP) is NPcomplete. Mastermind is a popular game which can be turned into a logical puzzle called the Mastermind Satisfiability Problem in a similar spirit to the Minesweeper puzzle [5]. By proving that MSP is NP-complete, we reveal its intrinsic computational property that makes it challenging and interesting. This serves as an ...
متن کاملOptimal Analyses for 3×n AB Games in the Worst Case
The past decades have witnessed a growing interest in research on deductive games such as Mastermind and AB game. Because of the complicated behavior of deductive games, tree-search approaches are often adopted to find their optimal strategies. In this paper, a generalized version of deductive games, called 3 × n AB games, is introduced. However, tranditional tree-search approaches are not appr...
متن کاملDifferential involvement of left prefrontal cortex in inductive and deductive reasoning.
While inductive and deductive reasoning are considered distinct logical and psychological processes, little is known about their respective neural basis. To address this issue we scanned 16 subjects with fMRI, using an event-related design, while they engaged in inductive and deductive reasoning tasks. Both types of reasoning were characterized by activation of left lateral prefrontal and bilat...
متن کاملInquiry Activities in a Classroom: Extra-logical Processes of Illumination Vs Logical Process of Deductive and Inductive Reasoning. a Case Study
The paper presents results of the research, which was focused on studying students’ inquiry work from a psychological point of view. Inquiry activities of students in a classroom were analysed through the evaluation of the character of these activities within learning process with respect to mathematician’s research practice. A process of learning mathematical discovery was considered in detail...
متن کامل