Consider an agent for playing Backgammon. You can see an example match here.

Formulate the search problem, that is,

1. find a representation (data structure) for states
2. find a representation (data structure) for actions
3. write down the initial state in your representation
4. develop a function computing the legal moves of each agent
5. develop a function computing the successor state resulting from executing a move in a state
6. develop a function deciding when a terminal state is reached
7. develop a function for deciding whether the agent has won the game