====== Lab 2 - Formulating Search Problems ======

===== Problem Description =====
Consider an agent for playing [[http://en.wikipedia.org/wiki/Backgammon#Rules|Backgammon]].
You can see an example match [[http://130.208.241.192/ggpserver/public/view_state.jsp?matchID=backgammon.1328187706746&stepNumber=2&role=RANDOM|here]].
===== Tasks =====
Formulate the search problem, that is,
  - find a representation (data structure) for states
  - find a representation (data structure) for actions
  - write down the initial state in your representation 
  - develop a function computing the legal moves of each agent
  - develop a function computing the successor state resulting from executing a move in a state
  - develop a function deciding when a terminal state is reached
  - develop a function for deciding whether the agent has won the game