a star search
This video explains slightly smarter ways to search. Uninformed search, greedely choosing the least cost at every step of the search, and informed (heurisitc) search which can be smarter. The video ends with the presentation and example of A* (A star). These figures and content are taken from AI, a modern approach: Russell and Norvig (2011)
▶︎
searching
▶︎
A* Search
▶︎
Breadth First Search - Part 1
▶︎
A* Pathfinding (E01: algorithm explanation)
▶︎
Artificial Intelligence - 3.5 - Informed (heuristic) search strategies
▶︎
How reading changes the way your brain works - BBC World Service
▶︎
China’s Secret | The Most Unbelievable Megaprojects in China | 4K Travel Documentary
▶︎
I Hacked This Temu Router. What I Found Should Be Illegal.
▶︎
Depth First Search
▶︎
Algorithms Explained – minimax and alpha-beta pruning
▶︎
A* search
▶︎
Animation vs. Math
▶︎
Portugal – Demokratische Republik Kongo Highlights | Gruppe K, FIFA WM 2026 | sportstudio
▶︎
Co-Creator of Haskell: Why Learn Functional Programming, Useless vs Useful Languages | Simon Jones
▶︎
I Analysed 47,000 Games of Catan. Here's How to Win Every Time (mathematically) 🎲🐑
▶︎
The Strange Math That Predicts (Almost) Anything
▶︎
Universal Optimality of Dijkstra's Shortest Path Algorithm
▶︎
Constraint satisfaction problems
▶︎