User Tools

Site Tools


public:t-622-arti-12-1:lab_2_-_formulating_search_problems

Lab 2 - Formulating Search Problems

Problem Description

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

Tasks

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
/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