Tilings are defined inductively. It is shown that one form of mutilated chess board cannot be tiled with dominoes, while another one can be tiled with L-shaped tiles. Sections 1 and 2 are by Paulson and described elsewhere [1]. Section 3 is by Nipkow and formalizes a well-known argument from the literature [2]. Please add further fun examples of this kind! theory Tilings imports Main begin

In this paper, I would like to argue { based on my personal programming experience { that implementing algorithms is FUN. Moreover, it can lead to a better understanding of the problem to be solved, it can help to avoid embarrassing mistakes, and the implemented algorithms can be used as a tool for teaching.

This research examined the hypothesis that situational achievement cues can elicit achievement or fun goals depending on chronic differences in achievement motivation. In 4 studies, chronic differences in achievement motivation were measured, and achievement-denoting words were used to influence behavior. The effects of these variables were assessed on self-report inventories, task performance,...

Playing games against people with a different skill level can be boring or frustrating, which decreases fun. A solution is to introduce specific rules that balance a game. In this paper we describe a study in which we used an electronic board game with tangible interaction to investigate whether balancing a game indeed increases fun experienced. We also investigate whether balancing skill level...

one can ask if there is stabilizing selection for fun and fairness that reins in the possible costs of behavior that can be too risky or too costly, including social play. We know, for example, that individual golden marmots, southern fur seals, and young bighorn sheep who are caught up in the frivolity of play seem to suffer more injuries and higher mortality than those who are not playing. So...