Effective player guidance in logic puzzles

Pen & paper puzzle games are an extremely popular pastime, often enjoyed by demographics normally not considered to be ‘gamers’. They are increasingly used as ‘serious games’ and there has been extensive research into computationally generating and efficiently solving them. However, there have been few academic studies that have focused on the players themselves. Presenting an appropriate level of challenge to a player is essential for both player enjoyment and engagement. Providing appropriate assistance is an essential mechanic for making a game accessible to a variety of players. In this thesis, we investigate how players solve Progressive Pen & Paper Puzzle Games (PPPPs) and how to provide meaningful assistance that allows players to recover from being stuck, while not reducing the challenge to trivial levels. This thesis begins with a qualitative in-person study of Sudoku solving. This study demonstrates that, in contrast to all existing assumptions used to model players, players were unsystematic, idiosyncratic and error-prone. We then designed an entirely new approach to providing assistance in PPPPs, which guides players towards easier deductions rather than, as current systems do, completing the next cell for them. We implemented a novel hint system using our design, with the assessment of the challenge being done using Minimal Unsatisfiable Sets (MUSs). We conducted four studies, using two different PPPPs, that evaluated the efficacy of the novel hint system compared to the current hint approach. The studies demonstrated that our novel hint system was as helpful as the existing system while also improving the player experience and feeling less like cheating. Players also chose to use our novel hint system significantly more often. We have provided a new approach to providing assistance to PPPP players and demonstrated that players prefer it over existing approaches

Sudoku em FPGA

Mestrado em Engenharia Electrónica e TelecomunicaçõesEste trabalho, desenvolvido no âmbito dos sistemas reconfiguráveis, tem como objetivo a implementação de um solucionador de puzzles Sudoku, quer em software quer em hardware, tentando minimizar o seu tempo de solução. Deste modo, foram desenvolvidos três solucionadores: Simples, apenas capaz de resolver puzzles simples, Tentativa e Erro, que implementa um algoritmo de Breadth-First Search para solucionar puzzles mais complexos, e, por fim, o solucionador Tentativa e Erro com capacidade para processamento paralelo, também este capaz de solucionar puzzles mais complexos. Todos estes solucionadores foram implementados e testados numa FPGA da família Spartan-3E da Xilinx, usando, para isso, uma placa de prototipagem da Digilent. Os resultados obtidos foram comparados entre as várias implementações abordadas, assim como com outros solucionadores existentes.This work, developed in the context of reconfigurable systems, has as an objective the implementation of a Sudoku solver, both in software and hardware, and attempting to minimize its solution time. Thus, three solvers were developed: Simple, only able to solve simple puzzles, Trial and Error, which implements a Breadth-First Search algorithm, being able to solve more complex puzzles, and, finally, the Trial and Error solver with the possibility of parallel processing, being also able to solve complex puzzles. All these solvers were implemented and tested on an FPGA of Xilinx Spartan- -3E family, using for this purpose a prototyping board from Digilent. The results were compared between the various implementations, as well as with other state-of-the-art solvers