Linear Programming Will See MUCH Deeper Than Alpha-Beta

Discussion of anything and everything relating to chess playing software and machines.

Moderator: Ras

User avatar
towforce
Posts: 12512
Joined: Thu Mar 09, 2006 12:57 am
Location: Birmingham UK
Full name: Graham Laight

Re: Linear Programming Will See MUCH Deeper Than Alpha-Beta

Post by towforce »

towforce wrote:Getting large ILP models to converge is often difficult anyway. There are various methods available - the cutting-plane method, branch and bound, branch and cut, and delayed column generation for example...
Note to anyone interested - try the Dantzig-Wolfe decomposition as a way to simultaneously break symmetry and get convergence.
Human chess is partly about tactics and strategy, but mostly about memory