Classic CSP Algorithms to solve RLFAP
-
Updated
Feb 20, 2021 - Python
Classic CSP Algorithms to solve RLFAP
📻📡 Solving the Constraint Satisfaction Radio Link Frequency Assignment Problem, using FC and MAC algorithms with the dom/wdeg heuristic. An attempt to solve it with MIN-CONFLICTS algorithm and some comparisons are also made.
Berkeley Pacman Projects (1 and 2), Depth First Search, Breadth First Search, Uniform Cost Search ,A* Search , Heuristic Functions ,Suboptimal Search, Minimax Algorithm, Alpha-Beta Pruning, Expectimax, Constraint Santisfaction Problems, RLFA CSP problem, Propositional Logic, First-order Logic
📡 The Radio Link Frequency Assignment Problem
Implementation of constraint satisfaction problem algorithms to solve the radio link frequency assignment problem - rlfap
Add a description, image, and links to the rlfap topic page so that developers can more easily learn about it.
To associate your repository with the rlfap topic, visit your repo's landing page and select "manage topics."