15-puzzle is a quite old and famous puzzle, which had its own peak of interest!

In this mission you are given a position of tiles - an array of 4 arrays of equal length with all numbers from 1 to 16 incl. in arbitrary order (but number 16 always stands for empty place!). Your function should return a boolean value, if this combination of tiles is solvable (may be transformed by valid moves to "normal" order) or not, as true or false respectively.

Here is an interesting video about the puzzle itself and its solvability problem with the algorithm of checking explained. So if you don't like spoilers, you may try to solve the mission first without watching the video.

Input: A position of tiles as an array of 4 arrays of numbers from 1 to 16 incl.

Output: Solvability of puzzle as boolean value.

Examples:

assert.strictEqual(
    fifteenPuzzle([
        [1, 2, 3, 4],
        [5, 6, 7, 8],
        [9, 10, 11, 12],
        [13, 14, 15, 16],
    ]),
    true
);
assert.strictEqual(
    fifteenPuzzle([
        [15, 14, 13, 12],
        [11, 10, 9, 8],
        [7, 6, 5, 4],
        [3, 2, 1, 16],
    ]),
    false
);
assert.strictEqual(
    fifteenPuzzle([
        [1, 5, 9, 13],
        [2, 6, 10, 14],
        [3, 7, 11, 15],
        [4, 8, 12, 16],
    ]),
    true
);
assert.strictEqual(
    fifteenPuzzle([
        [1, 3, 2, 4],
        [5, 7, 6, 8],
        [9, 11, 10, 12],
        [13, 15, 14, 16],
    ]),
    true
);

How it’s used: it's always interesting, what inner logic stands behind well-known games and puzzles.

Preconditions:

• len(position) == len(position[i]) == 4;
• set(sum(position, [])) == {1, 2, ... 16}.