Limits of Rush Hour Logic Complexity

Details Limits of Rush Hour Logic Complexity Limits of Rush Hour Logic Complexity

2005-02-15

arxiv.org/abs/cs/0502068v1

Computer Science

Computational Complexity

Scientific paper

Rush Hour Logic was introduced in [Flake&Baum99] as a model of computation inspired by the ``Rush Hour'' toy puzzle, in which cars can move horizontally or vertically within a parking lot. The authors show how the model supports polynomial space computation, using certain car configurations as building blocks to construct boolean circuits for a cpu and memory. They consider the use of cars of length 3 crucial to their construction, and conjecture that cars of size 2 only, which we'll call `Size 2 Rush Hour', do not support polynomial space computation. We settle this conjecture by showing that the required building blocks are constructible in Size 2 Rush Hour. Furthermore, we consider Unit Rush Hour, which was hitherto believed to be trivial, show its relation to maze puzzles, and provide empirical support for its hardness.

Affiliated with

Also associated with

No associations

Rating

Limits of Rush Hour Logic Complexity 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 Limits of Rush Hour Logic Complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Limits of Rush Hour Logic Complexity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-242533