In this paper, we propose a new algorithm for graph partitioning with an objective function that follows the min-max clustering principle. The relaxed version of the optimization of the min-max cut ...

Classic draughts (checkers) with AI based on min-max algorithm with alpha-beta prunings. Graphic representation bases on SFML 2.5.

In this paper, we propose a new algorithm for graph partitioning with an objective function that follows the min-max clustering principle. The relaxed version of the optimization of the min-max cut ...