Wednesday, November 30, 2016

[aigfrdxb] Jumping on a graph

Checkers can be generalized to any graph.  Color the edges.  A jump enters from an adjacent node, captures the piece on the node, and exits by another edge the same color as the inbound edge.

More fancy stuff: directed edges, different edges (same nodes) for different piece types.


No comments :