Wednesday, 22 January 2014

Gibraltar Masters 2012 - Best Game

GM Emanuel Berg from Sweden won the best game prize of the tournament (£1000) for his win over GM Maxim Vachier-Legrave. 
Excerpt from the Round 10 live commentary with GM Simon Williams.

Tuesday, 26 November 2013

Big Collection of puzzles (2000+ Puzzles so far WITH SOLUTIONS )

These puzzles were obtained from the tactics site, please go to the site and take a look around and get a feel for the puzzles. We believe these puzzles have a high educational value and they were hand made/hand picked by a master chess trainer and that's why we would like to share them with you. Again, please see the website for more details.

If it's white turn to move, then the puzzle will say 1-0, and if it's black's turn to move, it will be 0-1.There are all kinds of puzzles: tactics, all sorts of defensive puzzles, checkmates, quiet moves, and the puzzles range from very easy to very challenging. I think they provide a good range of difficulty and most importantly they seem to be very practical in nature.

Specials Thanks for the team in for collecting theses precious gems.

 PGN+PDF [ without solutions ]   PGN+PDF [ with solutions ] 

Sunday, 24 November 2013

Computational Aesthetics and Chess as an Art Form

Computational Aesthetics and Chess as an Art Form
Azlan Iqbal and Mashkuri Yaacob
Universiti Tenaga Nasional
Selangor, Malaysia

The Art of Chess Artists

The Art of Chess Artists - This is a great visual treat ....

The Art of Chess
, an exhibition featuring 15 of some of the most ac
claimed international
contemporary artists

Detecting Fortresses in Chess, Matej Guid, Ivan Bratko

Detecting Fortresses in Chess
Matej Guid, Ivan Bratko
Artificial Intelligence Laboratory, Faculty of Computer and Information Science, University of Ljubljana
We introduce a computational method for semi-automatical detecting fortresses in the game of chess.
It is based on computer heuristic search and can be easily used with any state-of-the-art chess program. We
also demonstrate a method for avoiding fortresses and show how to find a break-through plan when one exists.
Although the paper is not concerned with the question whether it is practical or not to implement the method
the state-of-the-art chess programs, the method can be useful, for example, in correspondence chess or
in composing chess studies, where a human-computer interaction is of great importance, and the time available
is significantly longer than in ordinary chess competitions

The History Heuristic and Alpha-Beta Search Enhancements in Practice -by - Jonathan Schaeffer

The History Heuristic and
Alpha-Beta Search Enhancements in Practice -by -
Jonathan Schaeffer
onathan Herbert Schaeffer (born 1957) is a Canadian researcher and professor at the University of Alberta and the Canada Research Chair in Artificial Intelligence.

He led the team that wrote Chinook, the world's strongest American checkers player, after some relatively good results in writing computer chess programs. He is involved in the University of Alberta GAMES group developing computer poker systems. Schaeffer is also a member of the research group that created Polaris, a program designed to play the Texas Hold'em variant of poker.Born in Toronto, Ontario, he received a Bachelor of Science degree in 1979 from the University of Toronto. He received a Master of Mathematics degree in 1980 and a Ph.D. in 1986 from the University of Waterloo. Schaeffer reached national master strength in chess while in his early 20s, but has played little competitive chess since that time....