According to the video, what are the three core behaviors shared by classical A* search, game AI, and modern tools like ChatGPT?
In the classical A* search formula f(n)=g(n)+h(n), what does the h(n) represent?
Why did classical AI hit a "wall" when trying to solve complex problems like the game of Chess?
What was the primary change during the "bridge era" when machine learning began to replace classical AI methods?
When viewing a Large Language Model (LLM) as a search graph, what does each edge (the connection between nodes) represent?
In the search space of an LLM, how is the "cost" of a path determined?
What is the primary advantage of Beam Search compared to simple "Greedy" decoding?
If a developer sets an LLM’s temperature to a high value (such as 1.5), what effect does it have on the output?
The video mentions "Tree of Thoughts" as a modern technique. How does this technique change how an LLM works?