A Termino Algorithm
Silver is a greedy algorithm designed to solve termino boards ranging from 10x10 to 1000x1000 size. At each time step, the algorithm calculates a least constraining heuristic. As I represented the board using a matrix, this was accomplished using a type of template matching. Silver runs in linear time complexity.
My Role:
As the sole developer on this project, I was responsible for algorithms creation and delivery. In development, I prototyped many approaches. One interesting implementation was to use policies trained by genetic algorithms, but ultimately the presented version achieved higher performance.
Skills:
Python
Algorithms
