game-playing-validates-search-replaceability-by-capacity

IN derived (depth 6)

Created 2026-06-21T11:49:53+00:00 · Reviewed 2026-06-21T15:37:01+00:00

Game-playing empirically demonstrates that explicit search (tree search, Monte Carlo methods) can be complemented or replaced by sufficient model capacity — AlphaGo combined deep neural networks with tree search, while a later transformer achieved grandmaster chess through pure static evaluation — suggesting that the search-vs-capacity tradeoff may be influenced by hardware-driven architecture selection, where increasing compute can reduce the need for explicit search, though both hybrid and pure neural paradigms remain viable depending on the game's computational structure.

Justifications

SL — The AlphaGo→transformer chess trajectory shows search being replaced by capacity as hardware scales, consistent with the broader principle that hardware economics is the primary selection pressure in ML evolution

Antecedents (all must be IN):

  • IN game-playing-validates-neural-search-hybrid — Game-playing demonstrates that neural networks achieve superhuman performance through two distinct paradigms — AlphaGo (2016) combined deep neural networks with tree search to master Go, while a transformer achieved grandmaster-level chess (Elo 2895) using pure static evaluation without any search — suggesting that both hybrid (neural+search) and pure neural approaches can reach expert-level game play, with each paradigm's dominance depending on the game's computational structure.
  • IN hardware-economics-primary-selection-pressure — Hardware economics is a primary selection pressure in ML's evolution — co-evolution with theory shapes choices from macro architecture decisions to micro implementation tradeoffs, and paradigm survival correlates more strongly with scalability than with theoretical completeness, suggesting that compute availability significantly shapes what ML becomes, alongside but often outweighing mathematical insight.

Dependents

These beliefs depend on this one: