chess problem solver l.
Skip this Video
Loading SlideShow in 5 Seconds..
Chess Problem Solver PowerPoint Presentation
Download Presentation
Chess Problem Solver

Loading in 2 Seconds...

play fullscreen
1 / 14

Chess Problem Solver - PowerPoint PPT Presentation

  • Uploaded on

Chess Problem Solver. Solves a given chess position for checkmate Problem input in text format. Problem Characteristics. Search tree solving method Very large computation Low communication requirement. Parallel Architecture. Message passing using PVM Master/Slave processes

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
Download Presentation

PowerPoint Slideshow about 'Chess Problem Solver' - mendel

An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
chess problem solver
Chess Problem Solver
  • Solves a given chess position for checkmate
  • Problem input in text format
problem characteristics
Problem Characteristics
  • Search tree solving method
  • Very large computation
  • Low communication requirement
parallel architecture
Parallel Architecture
  • Message passing using PVM
  • Master/Slave processes
  • Distributed task queues
  • Coarse grain tasks
  • Designed for future flexibility
implementation strategy
Implementation Strategy
  • Basic data unit
  • Basic software function
  • Tree search routine
basic data unit problem
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
basic software function
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.
search routine
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
master process requirements
Master Process Requirements
  • Input initial problem and break down into list of tasks
  • Determine the necessary number of slaves
  • Spawn the slave processes
  • Send tasks to slaves
  • Compile results obtained from slaves
  • Terminate the slaves when complete
slave process requirements
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.
possible enhancements
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 which cuts down stalled tasks
  • Only necessary for a large number of processors when using coarse grain strategy