| Current Forum: Homework 6 General Forum |
| Date: Sat Dec 1 2001 7:59 pm |
| Author: Chen, Richard <richardc@andrew.cmu.edu> |
| Subject: Re: Buggy DemoBoard? |
|
|
Read the game rules (http://members.aol.com/farisles/guilds/merels.htm or anyone of the literally dozens and dozens and dozens of sites searchable by search_engine_x which have rules for Nine Men's Morris, though I warn about minor variations in between them all at boundary scenarios):
stage 1 - you can move pieces to any square on the board because players are merely placing starting spaces/pieces (which begs the question, is a space still a space once a piece is on it? anyways)
stage 2 - this is the only stage during which only moves to adjacent squares is allowed
stage 3 - the or any player who has 3 or less pieces remaining can move to any free/non-occupied space on the board
Your board (a.k.a. your class TextDemo) and class TextDemo board cannot be equally smart unless you use the same decision trees and implementations as the TA's solution, so hopefully yours will be even smarter than the one in the given TextDemo to ensure victory in the tournament. Otherwise, if it is not "smarter" than the TA's solution (and by which metrics do we measure "smartness" of an algorithm as applied to this game?), it must be less smart. |
|