NMCS4ALL: Optimization by Hillclimbing
An introduction to the concepts of search, optimization, and hillcimbing, with demos. The New Mexico CS for All project is teaching computational thinking and programming. Production supported by the National Science Foundation, award # CNS 1240992 0:00 Intro: Search Creates Knowledge 1:12 What Is A Problem Space? 3:25 What Is Hillclimbing? 6:05 Demo: Steepest Ascent HC 8:35 Demo: Stochastic HC 9:48 Demo: Simulated Annealing 11:46 Demo: 2D Problem Space 14:00 Demo: 64 Dimensional Problem Space
▶︎
NMCS4ALL: Artificial Life (full version)
▶︎
NMCS4ALL: Random number generators
▶︎
NMCS4ALL: Machine Learning (full version)
▶︎
Solving The Eltrut Problem With Evolutionary Algorithms
▶︎
The Most Misunderstood Concept in Math
▶︎
Robust Local Synchronization - Research Notebook Video
▶︎
A* Pathfinding (E01: algorithm explanation)
▶︎
Bottom up engineering for robust-first computing
▶︎
Train Your Brain to Never Forget (5 Feynman Habits)
▶︎
Robust-first computing: Demon Horde Sort (full version)
▶︎
6. Monte Carlo Simulation
▶︎
Stating The Obvious Out Loud
▶︎
Building the PERFECT Linux PC with Linus Torvalds
▶︎
Listen and Feel the Peace | Tibetan Healing Sounds for Deep Meditation, Inner Peace & Soul Healing
▶︎
A* (A Star) Search Algorithm - Computerphile
▶︎
Flatten The Curve - How to Control an Artificial Life Pandemic
▶︎
Training Sand to Think: Artificial General Intelligence & Future of Physics
▶︎
6. Search: Games, Minimax, and Alpha-Beta
▶︎
The AI Take Over Has Completely Backfired and I Can't Be Happier
▶︎