کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
401406 675351 2009 19 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Harnessing parallel disks to solve Rubik’s cube
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
پیش نمایش صفحه اول مقاله
Harnessing parallel disks to solve Rubik’s cube
چکیده انگلیسی

The number of moves required to solve any configuration of Rubik’s cube has held a fascination for over 25 years. A new upper bound of 26 is produced. More important, a new methodology is described for finding upper bounds. The novelty is two-fold. First, parallel disks are employed. This allows 1.4×1012 states representing symmetrized cosets to be enumerated in seven terabytes. Second, a faster table-based multiplication is described for symmetrized cosets that attempts to keep most tables in the CPU cache. This enables the product of a symmetrized coset by a generator at a rate of 10 million moves per second.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Symbolic Computation - Volume 44, Issue 7, July 2009, Pages 872-890