کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
6875480 1441957 2018 5 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A simple proof that the (n2 − 1)-puzzle is hard
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
A simple proof that the (n2 − 1)-puzzle is hard
چکیده انگلیسی
The 15 puzzle is a classic reconfiguration puzzle with fifteen uniquely labeled unit squares within a 4×4 board in which the goal is to slide the squares (without ever overlapping) into a target configuration. By generalizing the puzzle to an n×n board with n2−1 squares, we can study the computational complexity of problems related to the puzzle; in particular, we consider the problem of determining whether a given end configuration can be reached from a given start configuration via at most a given number of moves. This problem was shown NP-complete in [1]. We provide an alternative simpler proof of this fact by reduction from the rectilinear Steiner tree problem.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical Computer Science - Volume 732, 7 July 2018, Pages 80-84
نویسندگان
, ,