By Topic

Mixed Integer Linear Programming Models to Solve the Shisen-Sho Puzzle

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Trindade, R.S. ; Comput. Sci., UNIFRA, Santa Maria, Brazil ; Dhein, G. ; Muller, F.M. ; Bassi de Araujo, O.C.

Shisen-Sho or Four Rivers is a game with perfect information where the objective is to remove all tiles from the board. In this work we present two mixed integer programming models for solving Shisen-Sho game, as well as techniques to improve the formulations proposed. The first mathematical model considers the classical problem of finding a sequence of moves to remove all tiles from the board, while the second mathematical model considers a variant in which it is necessary to optimize a sequence of movements according to a criterion defined by the authors. Computational results for the two models are presented considering different initial configurations and board dimensions.

Published in:

Theoretical Computer Science (WEIT), 2011 Workshop-School on

Date of Conference:

24-26 Aug. 2011