## Search found 449 matches

Mon Jan 05, 2009 12:03 pm
Forum: Computer Chess Club: General Topics
Topic: Linear Programming Will See MUCH Deeper Than Alpha-Beta
Replies: 20
Views: 4429

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

And yes navigation is similar to a chess search, just it has less nodes and no opponent. If you are talking about road navigation, then this is the shortest path problem - see http://en.wikipedia.org/wiki/Shortest_path . Most road navigation problems probably could be solved to optimum - but in-car...
Sun Jan 04, 2009 12:18 pm
Forum: Computer Chess Club: General Topics
Topic: Linear Programming Will See MUCH Deeper Than Alpha-Beta
Replies: 20
Views: 4429

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

Lets say you could somehow formulate chess as a linear programming problem in a similar fashion to TSP. You first have to generate the nodes. Here's the first problem: Agreed - generating the nodes in chess is absolutely out of the question. Given the number of LP expressions that would be required...
Sun Jan 04, 2009 11:00 am
Forum: Computer Chess Club: General Topics
Topic: Linear Programming Will See MUCH Deeper Than Alpha-Beta
Replies: 20
Views: 4429

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

Perhaps you could try a much simpler game. It's not so much a simpler game required here to make a working prototype as a ready-made ILP solver that can apply different objective functions to different expressions. Believe me - if this was a trivial problem, I wouldn't be describing a method for do...
Sun Jan 04, 2009 10:47 am
Forum: Computer Chess Club: General Topics
Topic: Linear Programming Will See MUCH Deeper Than Alpha-Beta
Replies: 20
Views: 4429

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

I am familiar with the travelling salesman finding the shortest route and with the exception that it is much smaller than a chess tree the same type of logic is used for both. It is unrealistic to think that chess could be solved to the same scale as the TSP (travelling salesman problem) - but just...
Sat Jan 03, 2009 10:51 pm
Forum: Computer Chess Club: General Topics
Topic: Linear Programming Will See MUCH Deeper Than Alpha-Beta
Replies: 20
Views: 4429

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

Alpha-beta is a branch and bound optimization algorithm and works well for a chess tree. I am guilty of greatly simplifying the issue and leaving lots of stuff unexplained!!! In ILP, when people talk about branch and bound, it goes without saying that they mean branch and bound combined with linear...
Sat Jan 03, 2009 9:55 pm
Forum: Computer Chess Club: General Topics
Topic: Linear Programming Will See MUCH Deeper Than Alpha-Beta
Replies: 20
Views: 4429

### Linear Programming Will See MUCH Deeper Than Alpha-Beta

For linear problems (of which chess is an example) integer linear programming (ILP) enables optimal values to be found relatively quickly in large search spaces. For example, the very largest proven TSP (travelling salesman problem) solutions uses variants of this method: the record is 85,900 towns ...
Fri Jan 25, 2008 1:14 pm
Forum: Computer Chess Club: General Topics
Topic: How to beat chess computers by Eduard Nemeth
Replies: 19
Views: 6874

### Re: How to beat chess computers by Eduard Nemeth

There's always the option of using the setup option to remove the computer's pieces (or at least to move them to less troublesome positions).
Thu Jan 24, 2008 8:01 pm
Forum: Computer Chess Club: General Topics
Topic: Which is the maddest, craziest engine?
Replies: 16
Views: 6009

### Re: Which is the maddest, craziest engine?

CS-Tal is great fun to play against. Ed Schroder once said that it felt more like a game of poker than a game of chess.
Fri Jan 18, 2008 8:50 am
Forum: Computer Chess Club: General Topics
Topic: Strong engines make more draws
Replies: 25
Views: 6368

### Re: Strong engines make more draws

Hi Kirill, thanks god I mustn't do the counting myself, a nice little Excel Script written on the fly does the job. I extracted all the stuff I got into some html-files. Just a note, in the upper row 50 means difference of +-0-49 Elo, 100 means +- 50-99 Elo, 150 means +- 100-149 Elo etc. etc. just ...
Thu Jan 17, 2008 11:16 pm
Forum: Computer Chess Club: General Topics
Topic: Strong engines make more draws
Replies: 25
Views: 6368

### Re: Strong engines make more draws

if the number of error free games goes from 2% to 6% (closer to perfect) that will increase the number of drawn games by a measurable amount in a very large collection of games, without getting remotely close to near-perfect chess in the entire game collection. If the average computer game is 100 m...