Long time ago (somewhere in 2015) I have written an article about Dijkstra and the shortest path. In that article, I draw a graph on a notebook, just to illustrate what I was trying to traverse: Today, I was thinking …
The Minimax algorithm is a fundamental decision-making rule used in Artificial Intelligence (AI) for two-player, zero-sum games, such as Chess, Checkers, and, in our case, Tic-Tac-Toe. It works by exploring every possible future state of the game to find the …
Python – The Minimax Algorithm: Achieving Perfect Strategy Read more »
Haskell is a statically typed, purely functional programming language known for its concise syntax and mathematical precision. It utilizes lazy evaluation, meaning it only calculates values when they are strictly needed, allowing for the creation of infinite data structures. This …
Haskell – Solving Simple Diophantine Equation with Functional Programming Read more »
Sliding tile puzzle is something that is actually easy, if you are a fan of the Rubic Cube. And if you want to solve it with IDA* (iterative Deepening A*) and with Manhattan heuristic, this is the correct place. The …