Solving Mahjong Solitaire boards with peeking

We first prove that solving Mahjong Solitaire boards with peeking is NP-complete, even if one only allows isolated stacks of the forms /aab/ and /abb/. We subsequently show that layouts of isolated stacks of heights one and two can always be solved with peeking, and that doing so is in P, as well as finding an optimal algorithm for such layouts without peeking. Next, we describe a practical algorithm for solving Mahjong Solitaire boards with peeking, which is simple and fast. The algorithm uses an effective pruning criterion and a heuristic to find and prioritize critical groups. The ideas of the algorithm can also be applied to solving Shisen-Sho with peeking.Comment: 10 page

Desperate housewives: An analysis of the characterisations of female gamblers portrayed in gambling movies in Hong Kong

This article examines portrayals of female gamblers in recent Hong Kong movies. The authors report that the depiction of female gamblers is very different from that of male gamblers in the movies made in the same period. Whereas the male gamblers are pitching a lonely and desperate battle against the evil opponent, the female gamblers portrayed in the movies are housewives or small-time players who gamble only for their personal gain. A general negative overtone in portrayals of female gamblers was interpreted as a reflection of the traditional view that discourages women from gambling. The shift of gambling themes in the Hong Kong movies has been identified to reflect the most salient concerns among Hong Kong residents. Such changes are attributed to particular social and cultural changes in the community

Traditional Wisdom and Monte Carlo Tree Search Face-to-Face in the Card Game Scopone

We present the design of a competitive artificial intelligence for Scopone, a popular Italian card game. We compare rule-based players using the most established strategies (one for beginners and two for advanced players) against players using Monte Carlo Tree Search (MCTS) and Information Set Monte Carlo Tree Search (ISMCTS) with different reward functions and simulation strategies. MCTS requires complete information about the game state and thus implements a cheating player while ISMCTS can deal with incomplete information and thus implements a fair player. Our results show that, as expected, the cheating MCTS outperforms all the other strategies; ISMCTS is stronger than all the rule-based players implementing well-known and most advanced strategies and it also turns out to be a challenging opponent for human players.Comment: Preprint. Accepted for publication in the IEEE Transaction on Game

The moving boundaries of social heat: gambling in rural China

Whilst gambling for money was prohibited during the Maoist era, since the 1980s it has become very common in many rural areas of central China. It is often the major communal activity in many villages, a focus point of daily gossip and an object of government campaigns. I describe several forms of gambling common in Bashan Township, Eastern Hubei Province, and relate them to local discourses on capability/skill and luck/fate. Gambling reproduces ‘social heat’, which is a desired form of social effervescence as long as it remains within certain boundaries. But the boundaries of accepted gambling and social heat in local sociality as well as those given in official representations and state discourse, are contested, and both stand in an ambiguous relationship to each other; a relationship that is described in terms of ‘cultural intimacy’. Using medium-range concepts such as ‘social heat’ and ‘cultural intimacy’ the article attempts to avoid the pitfalls of totalizing approaches which explain popular gambling as consequence of or resistance to ‘neoliberalism’