A chessboard is an 8x8 grid. If you can only move to an adjacent square (horizontally, vertically, or diagonally), how many distinct paths can you take from the top-left corner to the bottom-right corner, moving only down and right?