On the symbolic computation of the hardest configurations of the RUSH HOUR game

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4630 LNCS, Issue , 2007, Pages 220-233

  Collette, Sébastien ^a   Raskin, Jean François ^a   Servais, Frédéric ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; DATA STRUCTURES; MODEL CHECKING; THEOREM PROVING; TRAFFIC CONGESTION;

BOARD GAMES; COMPUTING RESOURCES; SYMBOLIC COMPUTATION; TRAFFIC JAM;

GAME THEORY;

EID: 38049023583     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75538-8_20     Document Type: Conference Paper

References (9)

1. Baldamus, M., Schneider, K., Wenz, M., Ziller, R.: Can American Checkers be Solved by Means of Symbolic Model Checking? In: Workshop on Formal Methods Elsewhere, Technical Report 00-11, pp. 3-17. University of Kent at Cantebury, UK (2000)
2. Bryant, R.E.: On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication. IEEE Transactions on Computers 40(2), 205-213 (1991)
3. Bryant, R.E.: Graph-based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers 35(8), 677-691 (1986)
4. 20 States and Beyond. In: Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science, pp. 1-33. IEEE Computer Society Press, Los Alamitos (1990)
5. Cimatti, A., Clarke, E., Giunchiglia, E., Giunchiglia, F., Pistore, M., Roveri, M., Sebastiani, R.: NuSMV 2: An OpenSource Tool for Symbolic Model Checking. In: Proceedings of the International Conference on Computer-Aided Verification (2002)
6. Flake, G.W., Baum, E.B.: RUSH HOUR is PSPACE-complete, or Why You Should Generously Tip Parking Lot Attendants. Theoretical Computer Science 270(1-2), 895-911 (2002)
7. Hearn, R.A., Demaine, E.D.: PSPACE-Completeness of Sliding-Block Puzzles and Other Problems through the Nondeterministic Constraint Logic Model of Computation. Theoretical Computer Science 343(1-2), 72-96 (2005)
8. Holzmann, G.J.: SPIN Model Checker, The: Primer and Reference Manual. Addison-Wesley, Boston (2004)
9. Meinel, C., Theobald, T.: Algorithms and Data Structures in VLSI Design: OBDD Foundations and Applications. Springer, Heidelberg (1998)