06-22-2020, 06:29 AM
That's a lot of questions 
I will try to answer to the last ones, if you need more, please send us another reply with the specific questions.
>> Do you support counting groups belonging to a Team?
Not in the version 9.0.3, to get the connections or groups, we use the union find data structure (https://en.wikipedia.org/wiki/Disjoint-s..._structure) but in the version 0.9.3, it is working by player, not by piece or by team. That's something we will do for the release 1.0.0
>> So to try to express the need in vocabulary terms: what I am looking for is probably a (count (regions (sites boundedBy ({players})) adjacent)) -- where boundedBy ({players}) means (difference (sites board) (sites ({players})) and adjacent is the type of connection relationship that determines whether two sites are in the same region. and "regions" signifies that the count is of the number of distinct regions, and not of the number of sites in the union of the regions. In other words, the board minus the sites occupied by those players is grouped into connected areas (defaulted as connection by adjacency) which can be counted.
I am not sure what you try to get here. Can you make an example with a simple board, something like a square board of size 5 with sites from the bottom left to the top right indexed 0 to 24. Tell me where are the pieces and what region you try to get according to their positions.

I will try to answer to the last ones, if you need more, please send us another reply with the specific questions.
>> Do you support counting groups belonging to a Team?
Not in the version 9.0.3, to get the connections or groups, we use the union find data structure (https://en.wikipedia.org/wiki/Disjoint-s..._structure) but in the version 0.9.3, it is working by player, not by piece or by team. That's something we will do for the release 1.0.0
>> So to try to express the need in vocabulary terms: what I am looking for is probably a (count (regions (sites boundedBy ({players})) adjacent)) -- where boundedBy ({players}) means (difference (sites board) (sites ({players})) and adjacent is the type of connection relationship that determines whether two sites are in the same region. and "regions" signifies that the count is of the number of distinct regions, and not of the number of sites in the union of the regions. In other words, the board minus the sites occupied by those players is grouped into connected areas (defaulted as connection by adjacency) which can be counted.
I am not sure what you try to get here. Can you make an example with a simple board, something like a square board of size 5 with sites from the bottom left to the top right indexed 0 to 24. Tell me where are the pieces and what region you try to get according to their positions.