Solving a Battleship board game as an optimization problem
-
Updated
Jun 21, 2022 - Python
Solving a Battleship board game as an optimization problem
A repo containing solutions to toy problems from Codewars.com | Moringa Mock Interview practice.
Eight puzzle solver using iterative deepening
Different algorithms to solve 0-1 knapsack and an algorithm to solve continuous knapsack
Self organizing maps (SOM) in Python3.
Add a description, image, and links to the toy-problems topic page so that developers can more easily learn about it.
To associate your repository with the toy-problems topic, visit your repo's landing page and select "manage topics."