Group graphs and computational symmetry on massively parallel architecture

Group graphs are used to implement and reduce routing time in a domain whose associated operators are invariant under a group of invariances in a massively parallel environment. The algorithms are implemented in a program that solves chess endgames, part of whose space is invariant under a noncommutative crystallographic group.<
>