We present a Java applet that uses Constraint Processing (CP) to assist a human in playing the popular game Minesweeper. Our goal is to illustrate the power of CP techniques to model and solve combinatorial problems in a context accessible to the general public. Minesweeper is a video game that has been included with Microsoft Windows since 1989. In this game, the player is presented with a gri...

We consider a game-theoretical problem called selfish 2-dimensional bin packing game, a generalization of the 1-dimensional case already treated in the literature. In this game, the items to be packed are rectangles, and the bins are unit squares. The game starts with a set of items arbitrarily packed in bins. The cost of an item is defined as the ratio between its area and the total occupied a...

We describe the experimental development of an AI player that adapts to different point systems for Parameterized Poker Squares. After introducing the game and research competition challenge, we describe our static board evaluation utilizing learned evaluations of abstract partial Poker hands. Next, we evaluate various time management strategies and search algorithms. Finally, we show experimen...

Given a non-cooperative, continuous game, we describe a framework for parametric utility learning. Using heteroskedasticity inference, we adapt a Constrained Feasible Generalized Least Squares (cFGLS) utility learning method in which estimator variance is reduced, unbiased, and consistent. We extend our utility learning method using bootstrapping and bagging. We show the performance of the prop...

Most readers are familiar with cellular automata (CA) utilizing squares as cells, and are also familiar with the most famous automaton, Conway’s Game of Life. This game is played on an infinite grid of squares, and has been thoroughly explored in many publications [1, 2] as well as on numerous websites. In 1994 in this journal the author introduced several games of life in the triangular tessel...