The Faculty Notebook, September 2019

The Faculty Notebook is published periodically by the Office of the Provost at Gettysburg College to bring to the attention of the campus community accomplishments and activities of academic interest. Faculty are encouraged to submit materials for consideration for publication to the Associate Provost for Faculty Development. Copies of this publication are available at the Office of the Provost

Grand theft algorithm: purposeful play, appropriated play and aberrant players

"Copyright ACM, 2008. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in MindTrek: Proceedings of the 12th international conference on Entertainment and media in the ubiquitous era. pp.3-7 http://doi.acm.org/10.1145/1457199.1457201"This paper explores ideas about 'appropriated play' within computer games. It identifies different forms of 'purposeful' and 'aberrant' playing and proposes a model of players' motivations. This will enable a discussion about the experience of games players who resist the norms of 'purposeful' or ludic play, while finding reward in their explorations of game possibilities. It provides a new vocabulary for discussing playing outside of the game world, as a way of understanding some of these actions as more than 'cheating'

A Survey of Monte Carlo Tree Search Methods

Monte Carlo tree search (MCTS) is a recently proposed search method that combines the precision of tree search with the generality of random sampling. It has received considerable interest due to its spectacular success in the difficult problem of computer Go, but has also proved beneficial in a range of other domains. This paper is a survey of the literature to date, intended to provide a snapshot of the state of the art after the first five years of MCTS research. We outline the core algorithm's derivation, impart some structure on the many variations and enhancements that have been proposed, and summarize the results from the key game and nongame domains to which MCTS methods have been applied. A number of open research questions indicate that the field is ripe for future work

The Mathematics Behind Sudoku and How to Create Magic Squares

Sudoku puzzles date back to the 1800s in France and were introduced to America in the late 1970s. Since then, the puzzle has become a worldwide phenomenon. This thesis will be of expositional nature including the works of books and mathematical papers such as [2], [14], and [15], among others. The pages ahead will contain answers to some common questions about Sudoku such as, what is the minimum number of starting clues that will produce a unique solution? On the other side of the spectrum, what is the maximum number of starting clues that won’t produce a unique solution? Taking Sudoku one step farther, this paper will talk about Magic Squares and the algorithm used in making them. Even more interesting is that the al- gorithm provides the makings of a multimagic square, where every entry in a magic square is squared, with the rows, columns, and diagonals still adding to the same number [15]. See the Appendix for the computer code in the program MATLAB that creates multimagic squares

Why Philosophers Should Care About Computational Complexity

One might think that, once we know something is computable, how efficiently it can be computed is a practical question with little further philosophical importance. In this essay, I offer a detailed case that one would be wrong. In particular, I argue that computational complexity theory---the field that studies the resources (such as time, space, and randomness) needed to solve computational problems---leads to new perspectives on the nature of mathematical knowledge, the strong AI debate, computationalism, the problem of logical omniscience, Hume's problem of induction, Goodman's grue riddle, the foundations of quantum mechanics, economic rationality, closed timelike curves, and several other topics of philosophical interest. I end by discussing aspects of complexity theory itself that could benefit from philosophical analysis.Comment: 58 pages, to appear in "Computability: G\"odel, Turing, Church, and beyond," MIT Press, 2012. Some minor clarifications and corrections; new references adde