Lab 2 - Formulating Search Problems
Consider an agent for playing Backgammon.
You can see an example match here.
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
/var/www/ailab/WWW/wiki/data/pages/public/t-622-arti-12-1/lab_2_-_formulating_search_problems.txt · Last modified: 2012/02/02 12:47 by stephan