Use UGent CaGe as graph generator

[wschella]

Why write someting that is already written, right? We might want to explore UGent's own CaGe, or 'Chemical and Abstract Graph Environment'. A set of graph generators for various classes of graphs written in C.

There also is a Java GUI client, which might provide usefull for a more carefully selected graph in a live tournament setting.

We currently use a bash-script by @NoctuaNivalis that does it job more than fine. But bash.

[ninewise]

You just said "But Bash" like it's a downside, but we both know you'll never be able to improve it.

[feliciaan]

The script, nobody is able to improve this :) (without rewriting)

[wschella]

As a wise man once said:

Soms zie je door de bc de berekeningen niet meer.

By no means I inted to render obsolete your this contribution, both generators can live together in peace and harmony.

[ninewise]

@feliciaan, to rewrite, you first have to understand...

But I'm nice, and graph generation is really easy:

• Generate about 10 + <players>^2 forts in a field of 2 * <forts> on 3 * <forts> / 2 field, each with a distance of at least sqrt(8).
• Add edges (in order, from shortest to longest) if:
  • the new edge doesn't cut any previous edges and;
  • the nodes aren't connected yet or the new edge doesn't pass close to another fort.

The definition of close is as follows:

[feliciaan]

Website. Graphs. Ranker. Arbiter.

Long ago, the four modules lived together in harmony. Then everything changed when the graph generators attacked.

Only the Avatar, master of all four modules, could stop them. But when the world needed him most, he vanished.

A hundred years passed and my brother and I discovered the new Avatar, an arbiter named @wschella , and although his arbiting skills are great, he still has a lot to learn before he's ready to save anyone.

But I believe @wschella can save the world.