Marek, the pan-dimensional super being, has arbitrarily defined his current location as (0,0,0,0,0,0) in 6D hyperspace. He wishes to reach location (3, 0, 2, 0, 4, 3) by one of the many shortest paths available. Despite his immense power, he can only move one hyperstep at a time, each hyperstep consisting of a unit change in exactly one of the coordinate values. Any hyperstep is of equal ‘length’.

From how many of the shortest paths can he choose?

[HINT: You could try an easier problem first.]

Author: Leslie Green