Search found 433 matches

by Aleks Peshkov
Mon Jun 25, 2007 8:27 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Article on proposed heuristic for computer chess program
Replies: 11
Views: 6228

Re: Article on proposed heuristic for computer chess program

Some important squares are well-known: weakness in pawn formations, opened files, light/dark squares, knight outposts can be precomputed in piece-square tables. Another important square type is local SEE complexity: the more attackers and defenders, the more valuable became the control of that squar...
by Aleks Peshkov
Mon Jun 25, 2007 6:15 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Article on proposed heuristic for computer chess program
Replies: 11
Views: 6228

Re: Article on proposed heuristic for computer chess program

Influence of nearest 1-ply, 2-ply, 3-ply "mobilities" are dramatically different, so sum of them have very little meaning. So I think your "deep" mobility number is not any better then a simple 1-ply mobility lookup, and may be even worse because it is too optimistic. IMHO positional pressure is not...
by Aleks Peshkov
Mon Jun 18, 2007 4:28 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: A program that should be written
Replies: 9
Views: 5357

Re: A program that should be written

It would be nice to have utility for: 1) running multi-engine tournaments with PGN output and ELO-rating; 2) running EPD batch tests collecting timing and performance; 3) connecting to available online chess servers and collecting PGN games. IMHO it should be a run in host mode and be transparent fo...
by Aleks Peshkov
Tue May 29, 2007 1:31 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: New Protocol?
Replies: 4
Views: 3719

Re: New Protocol?

What's wrong with UCI and many existing GUI and engines?
IMHO all the need is an ICC adapter written as UCI-engine.
by Aleks Peshkov
Sat May 19, 2007 12:06 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Forty five years ago
Replies: 19
Views: 14404

Re: Pot-chess

sje wrote:I wonder what papers or programs being written today will be of any interest four or five decades from now.
IMHO selective search was forbidden between centuries. Computers goes quicker and quicker but frontier nodes costs relatively more and more.
by Aleks Peshkov
Sat May 19, 2007 1:15 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Forty five years ago
Replies: 19
Views: 14404

Re: Forty five years ago

The same article, but readable version:
http://www.kotok.org/AI_Memo_41.html
by Aleks Peshkov
Tue May 15, 2007 11:29 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: doing undoing
Replies: 5
Views: 5937

Re: doing undoing

Gerd Isenberg wrote:...where one usually spends much more time in leaf-nodes - also a futility-pruning versus lazy-eval issue.
Please explain the last statement a bit.
by Aleks Peshkov
Thu May 10, 2007 2:15 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Clone Solution: SOLOPO
Replies: 1
Views: 3165

Re: Clone Solution: SOLOPO

I think SOLOPO is very dull option, it probably looks like FORTRAN or BASIC, but using Russian words as language keywords.
by Aleks Peshkov
Thu May 10, 2007 2:05 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: About pawn hash tables
Replies: 6
Views: 6835

Re: About pawn hash tables

If your pawn evaluation depends on material, add material counter to pawn structure hash-key.