Exploitation of parallel search space evaluation with FPGAs in combinatorial problems: the Eternity II caseExploitation of parallel search space evaluation with FPGAs in combinatorial problems: the Eternity II case Δημοσίευση σε Συνέδριο Conference Publication 2015-11-172011enThe Eternity II puzzle is a combinatorial search problem which qualifies as a computational grand challenge. As no known closed form solution exists, its solution is based on exhaustive search, making it an excellent candidate for FPGA-based architectures, in which complex data structures and non-trivial recursion are implemented in hardware. This paper presents such an architecture, which was designed and fully implemented on a Virtex5 FPGA (XUP ML505 board). Despite the serial nature of the recursion, as parallelism can be applied with the initiation of multiple searches, the system shows a measured speedup of 2.6 vs. a high-end multi-core compute server.http://creativecommons.org/licenses/by/4.0/264-268International Conference on Field Programmable Logic and Applications Malakonakis Pavlos Μαλακωνακης Παυλος Dollas Apostolos Δολλας Αποστολος Institute of Electrical and Electronics Engineers Field programmable logic arrays FPGAs field programmable gate arrays field programmable logic arrays fpgas