# Chess Problem Solver - PowerPoint PPT Presentation

PPT – Chess Problem Solver PowerPoint presentation | free to download - id: 1d43c4-YzMwO

The Adobe Flash plugin is needed to view this content

Get the plugin now

View by Category
Title:

## Chess Problem Solver

Description:

### Chess Problem Solver. Solves a given chess position for ... Contains all necessary information about the state of a position. Status of pieces on board ... – PowerPoint PPT presentation

Number of Views:240
Avg rating:3.0/5.0
Slides: 15
Provided by: meseec
Category:
Transcript and Presenter's Notes

Title: Chess Problem Solver

1
Chess Problem Solver
• Solves a given chess position for checkmate
• Problem input in text format

2
Problem Characteristics
• Search tree solving method
• Very large computation
• Low communication requirement

3
Parallel Architecture
• Message passing using PVM
• Master/Slave processes
• Designed for future flexibility

4
Implementation Strategy
• Basic data unit
• Basic software function
• Tree search routine

5
Basic Data Unit Problem
• Contains all necessary information about the
state of a position
• Status of pieces on board
• Whose turn to move
• What player to solve the problem for
• Maximum levels to search
• The move that was made to get there

6
Basic Software Function
• Breaks down a given problem using all possible
moves.
• Generates a new list of problems.
• Is used to create the branches in the search tree.

7
Search Routine
• Examines a problem and determines the necessary
action.
• There are two possibilities
• the problem represents an end node
• the node represents a possible solution
• the node does not represent a possible solution
• the problem is incomplete and the search levels
have been exhausted
• further investigation is necessary
• break down the problem

8
(No Transcript)
9
Master Process Requirements
• Input initial problem and break down into list of
• Determine the necessary number of slaves
• Spawn the slave processes
• Compile results obtained from slaves
• Terminate the slaves when complete

10
Slave Process Requirements
• Wait for command from master (solve problem,
transfer work, or terminate)
• On solve problem command, solve the problem and
return results to the master
• On transfer work message, send work to another
slave process
• Terminate message kills the slave process.

11
(No Transcript)
12
Possible Enhancements
• Assign processors to a number of groups
• Each group will have its own master (determined
by lowest TID for example)
• Assign a task to each group
• Will cut down on communication to/from the master