Yet Another Novice Tries To Write AGo Program/ Move Undo Data Structure And Algorithm

I gleaned this from Bruce Wilcox's discussion of RiscIgo. He describes his move structure as:

What caught my eye is Kill Directions. How can 4 bits be enough information to replace captured stones upon undo? Ah, well of course! You just flood fill starting at the adjacent empty point(s).

[Diagram]

Capture

W1 is:

[Diagram]

Undo

To undo this move, just flood fill with opposite color from the North (n) and South (s) points and then empty the location.

[Diagram]

Undo

Nifty!


[Welcome to Sensei's Library!]
StartingPoints
ReferenceSection
About