chess shootme now edition n.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
Chess: Shootme now Edition PowerPoint Presentation
Download Presentation
Chess: Shootme now Edition

Loading in 2 Seconds...

play fullscreen
1 / 10

Chess: Shootme now Edition - PowerPoint PPT Presentation


  • 108 Views
  • Uploaded on

Chess: Shootme now Edition. By: Sean Sprigg and Tom Samaras. Objectives:. Develop a simple chess game. Use multiple simple data structures to simulate various items in the game

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

Chess: Shootme now Edition


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
    1. Chess:Shootmenow Edition By: Sean Sprigg and Tom Samaras

    2. Objectives: • Develop a simple chess game. • Use multiple simple data structures to simulate various items in the game • Develop working algorithms to evaluate, manipulate, and run the game relatively efficiently but without cutting corners • Develop an AI to allow human vs. computer capability • Kill ourselves

    3. Classes Developed: • Board – vector< vector < *Piece > > • Piece – contains color, name, position and other data members • None, Pawn, Rook, Knight, Bishop, Queen, and King all derived from Piece • Player – contains pointer to Board, name, color • Opponent – derived from Player

    4. Classes Developed: • DTnode – Decision Tree node, contains pointer to parent, vector of pointers to children and a MOVE struct • DTree – the Decision Tree contains sets of possible moves and then subsequent sets of possible moves. Children depend on their parent.

    5. Main Algorithms Developed: • updateMove() – reviews a piece’s move list and deletes invalid moves while paying attention to special move cases • movePiece() – moves a piece while ensuring an illegal situation is not created by the move • isCheckmate() – looks over board for a checkmate situation • isStalemate() – looks over board for a stalemate situation

    6. Main Algorithms Developed: • makeScore() traverses the board and scores based upon each piece’s status • makeDecision() based upon the score of possible moves, chooses the best* one *the current algorithm is very aggressive and short sighted, it chooses without considering subsequent moves

    7. Develop a simple chess game. Use multiple simple data structures to simulate various items in the game Develop working algorithms to evaluate, manipulate, and run the game relatively efficiently but without cutting corners Develop an AI to allow human vs. computer capability ☺ ☺ ☺ ☺ Accomplishments:

    8. Objectives in Progress: • Kill ourselves… → Data Structures Final Exam

    9. Implement a relatively good AI Create a GUI Multi-platform Network Future Improvements:

    10. Chess: Shootmenow Edition in action