Zen Puzzle Garden is NP-complete

Details Zen Puzzle Garden is NP-complete Zen Puzzle Garden is NP-complete

2011-06-10

arxiv.org/abs/1106.2104v1

Computer Science

Computational Complexity

Submitted

Scientific paper

Zen Puzzle Garden (ZPG) is a one-player puzzle game. In this paper, we prove
that deciding the solvability of ZPG is NP-complete.

Affiliated with

Also associated with

No associations

Rating

Zen Puzzle Garden is NP-complete 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 Zen Puzzle Garden is NP-complete, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Zen Puzzle Garden is NP-complete will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-320743