I've been giving some thought recently to what a finite state machine for the Japanese rules of go would look like. The more I think about it, the more complex encoding the full rules will be.
Which isn't to say that trying to build an FSM is necessarily a bad thing...
10 comments:
Which Japanes rules You are trying to implement?
I working from the rules at:
http://www.cs.cmu.edu/~wjh/go/rules/Japanese.html
Tak a look at Robert Jasiek page.
http://home.snafu.de/jasiek/rules.html#ruletextsJapaneseStyleRules
You probably should try to implement som logical rules without flaws, maybe
http://home.snafu.de/jasiek/j2003.html
But why finite state machine?
Any algorithm using finite memory is equivalent to FSM.
But why finite state machine?
Any algorithm using finite memory is equivalent to FSM.
I'm using a finite state machine because it is the easiest form in which to check that I've got valid outputs for all possible inputs. The table-form of a finite state machine is very usful for this.
The graph-form is also makes it very easy to check the reachability of states and similar.
good blog dude
the japanese rules of go can be coded into a fsm, I think it was already done at stanford u though... SpiruDye Cheer
Post a Comment