Vitosh    This is a small, but surprisingly whole and satisfying project we take a wine review of a few sentences and we train a tiny neural network to guess...

Vitosh    In the article from 1984, Fredman and Komlos (1) mention the perfect hash function, that actually can store a sparse table with 0(1) worst case...

Vitosh    Searching through 399 documents or 40 web pages (the numbers are not random) can be a tough task if you rely on standard tools like ctrl f. When the...

Vitosh    In our previous article, we explored the A (A-Star) Algorithm. It is the gold standard for pathfinding as it is optimal it always finds the shortest...

Vitosh    A is probably my favourite graph search algorithm. Some 10 years ago, I have implmented it with Excel and after that I have written a few more...

Vitosh    In the previous articles, we have presented graphs with BFS and DFS. The BFS is actually good to find the path with the fewest nodes. But if the path...

Vitosh    BFS, DFS, A-Star these sound like magic spells from a Harry Potter book And actually, these are magical (especially the A-Star) as far as they are...

Vitosh    Yesterday (blogging every day now ) I have presented a visualization with Python, in which a simple and basic graph was displayed. Today, I have...

Vitosh    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...

Vitosh    The Minimax algorithm is a fundamental decision-making rule used in Artificial Intelligence (AI) for two-player, zero-sum games, such as Chess,...