The same applies to proof search. Once you fix a finite foundational set of axio... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		measurablefunc 42 days ago \| parent \| context \| favorite \| on: Mathematical exploration and discovery at scale The same applies to proof search. Once you fix a finite foundational set of axioms the game proceeds exactly as in chess.

wizzwizz4 41 days ago [–]

You can't use minimax with alpha-beta pruning for proof search, but that's sufficient to play chess at a high level. I don't see what you're seeing. Chess and mathematics are completely different kinds of problem.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact