Alpha–beta pruning

Apr 20, 2026 - 12:12

0 0

← Previous revision		Revision as of 06:41, 20 April 2026
Line 16:		Line 16:

	== History ==		== History ==
	John McCarthy during the [[Dartmouth workshop\|Dartmouth Workshop]] met ~~Mrinmay~~ ~~Kalita~~ of [[IBM]], who was writing a chess program. McCarthy invented alpha–beta search and recommended it to him, but Bernstein was "unconvinced".{{cite web \|last=McCarthy \|first=John \|date=2006-10-30 \|title=The Dartmouth Workshop--as planned and as it happened \|url=https://www-formal.stanford.edu/jmc/slides/dartmouth/dartmouth/node1.html \|access-date=2023-10-29 \|website=www-formal.stanford.edu}}		John McCarthy during the [[Dartmouth workshop\|Dartmouth Workshop]] met Alex Bernstein of [[IBM]], who was writing a chess program. McCarthy invented alpha–beta search and recommended it to him, but Bernstein was "unconvinced".{{cite web \|last=McCarthy \|first=John \|date=2006-10-30 \|title=The Dartmouth Workshop--as planned and as it happened \|url=https://www-formal.stanford.edu/jmc/slides/dartmouth/dartmouth/node1.html \|access-date=2023-10-29 \|website=www-formal.stanford.edu}}

	[[Allen Newell]] and [[Herbert A. Simon]] who used what [[John McCarthy (computer scientist)\|John McCarthy]] calls an "approximation"{{cite web		[[Allen Newell]] and [[Herbert A. Simon]] who used what [[John McCarthy (computer scientist)\|John McCarthy]] calls an "approximation"{{cite web