Simple backtracking algorithm that solves the lights up problem returning the minimum quantity of bulbs necessary to light up all cells of a grid. Given a square grid of white and black cells, find the minimum number of light bulbs that can be placed in white cells such that all white cells in the grid are covered by light. The light bulbs can only send rays of light in the same row and in the same column. However, the ray is be blocked if it finds a black cell.
# Clone repository
$ git clone https://github.com/vitalinarh/Lights-Up
# Go to repository directory
$ cd Lights-Up
# Install dependencies
$ pip install -r requirements.txt
To run the project:
$ python3 lightup.py