Problem:

Imagine a King on an 8x8 chessboard.

It's located in a1, bottom left corner.

And it wants to get to a8, top left corner.

It can only move one step at a time, diagonally, vertically and horizontally.(Surprised)

How many different ways can it get there?

Is there a specific formula?

P.S Please tell me if there's a short way of doing it (or as an equation or formula), don't list all the possibilities.

thanks.