This is a proof of concept project meant to solve a csp problem without the use of existing libraries such as python-constraint.
Suppouse we have a set of sensors and tragets we want to identify as many targets as possible at given time while satisfying the following constraints: 1-Each sensor can only focus on 1 target at a time. 2-Three sensors are required to identify a target's position.
*note that sensors have a given range.
This is achived using two matrices. One for determining which sensors are in each other's range and can communicate and another one for determining which targets are in which sensors effective range. then using these two matrices we generate a tree and navigate it with a dfs approach.
Make sure you have Python and required libraries installed and run python gui.py.
Please refer to issues tab to see a list of current identified issues or to to submit your own.