Solving Mahjong Solitaire boards with peeking

Details Solving Mahjong Solitaire boards with peeking Solving Mahjong Solitaire boards with peeking

2012-03-29

arxiv.org/abs/1203.6559v1

Computer Science

Computational Complexity

10 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Solving Mahjong Solitaire boards with peeking does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Solving Mahjong Solitaire boards with peeking, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solving Mahjong Solitaire boards with peeking will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-57936