You are given 64 stones labelled with number 1 to 64 each. All those stones are randomly placed on the squares of a 8x8 chess board such that each square is occupied with exactly one stone. A move is defined by exchanging the stones of two squares. The goal of those moves is to get a constellation where the sum of any two adjacent numbers either horizontally, vertically or diagonally is not a prime number.
Can this be achieved with a maximum of 26 moves?