This is a tool, written in Python 3.7, to find all almost-winning and surely-winning strategies from games expanded by a MKBSC

Authors: Jakob Lycken and Simon Westerlund

Supervisor: Dilian Gurov

If there are any questions regarding the tool, you can mail Jakob at [email protected].
The paper can be found here

This tool is best paired with the mkbsc tool found here with the stratsynth folder placed in the same root folder as the mkbsc folder.

For documentation and a tutorial, please refer to user guide

Here is the meat and potatoes of the synthesiser. In this file is the two classes Agent_strat_synth() and Coalition_strat_synth() that finds winning strategies for the individual agent and the coalition of agents respectivily.

The classes Graph(), Agent_graph(Graph) and Coalition_graph(Graph) creates a traversable graph for agents and the coalition in the form of dictionaries made of vertices from vertex.py.

Creates the vertices.

Since the program is a stand alone product it can be used to find winning strategies as long as there are .dot files creates in the same style as by the MKBSC-tool.