Before we begin, I am aware of the article by François Dominic Laramée on GameDev.Net which can be found here!

What I would like to know, is there anything anyone would like to add to that article?

Have there been any significant break throughs on Chess AI, any information on deep brute force searches.

I am intending on some point in time to make a supplemental addition to François's work, updating the code to optimized C++, possibly with some features in assembly, in particular targeting 64-bit machines.

I have read through François's work quite a few times now, and am ever amazed by the amount of work that has gone into the simple concept of computer chess.

I seek to improve upon the techniques, and introduce some win-board/X-board compatability to the code given, as well as describe the protocol of it.

By the time I have finished, I seek to have a framework capable of running from within programs such as chessmaster, but left open for people to use an API to adjust the way the AI decides upon its route.

Please read through François's work, and let me know if you can expand upon it here, I'd like to know if there are any good features I could add to an open source API.

It will, eventually, be my final goal, to have this API available on high level languages such as C# and Java, with most of the implementation in optimized C++/assembler.



EDIT: Sorry for the double post, I was unaware it had happened as directly after I had made the post my browser had crashed, and I got distracted by a chess game going on on my laptop, will try not to do it ever ever again....

Before we begin, I am aware of the article by François Dominic Laramée on GameDev.Net which can be found here!

What I would like to know, is there anything anyone would like to add to that article?

Have there been any significant break throughs on Chess AI, any information on deep brute force searches.

I am intending on some point in time to make a supplemental addition to François's work, updating the code to optimized C++, possibly with some features in assembly, in particular targeting 64-bit machines.

I have read through François's work quite a few times now, and am ever amazed by the amount of work that has gone into the simple concept of computer chess.

I seek to improve upon the techniques, and introduce some win-board/X-board compatability to the code given, as well as describe the protocol of it.

By the time I have finished, I seek to have a framework capable of running from within programs such as chessmaster, but left open for people to use an API to adjust the way the AI decides upon its route.

Please read through François's work, and let me know if you can expand upon it here, I'd like to know if there are any good features I could add to an open source API.

It will, eventually, be my final goal, to have this API available on high level languages such as C# and Java, with most of the implementation in optimized C++/assembler.



EDIT: Sorry for the double post, I was unaware it had happened as directly after I had made the post my browser had crashed, and I got distracted by a chess game going on on my laptop, will try not to do it ever ever again....

So what EXACTLY is it that you're asking for? Chess game AI tips? I don't quite understand...

[font="arial, verdana, tahoma, sans-serif"]I don't think this forum is the right place to look for this, because chess programming is too specific. I did write a decent chess program years ago, so I can help people understand the basics, but to go beyond that I can recommend these two websites:[/font]
[size=2]* A good source of information, organized as a Wiki: http://chessprogramm...wikispaces.com/
[font="arial, verdana, tahoma, sans-serif"] * A forum where the authors of most of the strong chess programs hang out: http://talkchess.com/forum/index.php[/font]