In article UCYIc.50135$eO.45893@edtnps89, says... Can you guide me how to convert *.pbm files to *.pgn files? Or how to use *.pbm files. Which software creates them? Thanks a lot. A search on google gives this page, but there is plenty of reading material and help if you look. http://perso.wanadoo.fr/problemiste/help_e/index.html?idd_retrouve.htm

Hello All, Has anyone read "Bobby Fischer goes to war"? Got it for my birthday, and it seems good so far. Muggs

I don't think you can record/probe the main transposition table during quiescence search, because the evaluation is fundamentally different, taking only captures etc into account. Would it make sense to add another transposition table just for the quiesence searches? Does anyone do this, tried it?

I think its been explained here how Crafty has a somewhat lower NPS speed than other programs out there. I've recently used Arena in tournament mode to face off Ruffian 1.0.5 and Crafty 19.13 (timecontrol of 40 moves in 35 min) and not only were the results steeply in favor of Ruffian but it was clear that Ruffian was searching up to 70% more nodes than Crafty. I can't help but think that...

Problemist is a Windows program entirely dedicated to the chess problem: - Solves orthodox chess problems: direct mates, helpmates, selfmates from 2 up to 6 moves. - Writes and prints the solutions with many options. - Prints beautiful diagrams. - Manages archives which can contain thousands of problems. - And many other features (twins, searching of positions, etc...) - PGN & EPD Import /...

Just for the record, if I let my engine play 5 half moves with search depth 5 (total 324 knodes searched), these are the results: king-pawn table size %hits %table full 1 30%(!) 100% 10 42% 100% 100 60% 100% 1000 74% 100% 10000 85% 91%

Did anyone know something about programs (source codes or strategy representation) using genetic algoritms? I need links or contact to experts. Pablo

Hey, just curious how chess programs detect draw by repetition in their search. I have no idea how to implement this in my program. ~Ryan

There are many sources on the web that provide chess opening lines (eg ECO), but of course the holy grail is to determine how good a particular book move is. An idea would be to have the engine search the complete book nodes to all leaves (pure minimax without cutt-offs), and then perform an n-depth evaluation for all book leaves (minimax with all the alpha-beta stuff, etc), and add the results...

Dear Mike, Although I do not agree with Jasom Repa's and other methods - I do now believe you are violating the spirit of usenet by promoting your software, company and/or yourself on usenet. I respectfully ask that you reconsider your marketing plan and your of usenet for your personal gain. Bookup is a great product, but I believe there must be a better ways to market Bookup. I suggest...

If you have one complete and in good condition I'm interested! Let me know the price . Thank You! Charles

Hello all, I used to be a pretty good casual player but after 20 years away from the game I find I'm a pretty sorry player who wants to get better. Please recommend a program that I can play against, is easy to use, can easily be brought down to my level and perhaps most importantly, has good training/teaching features. Fritz and Shredder seem to be favorites here and ChessMaster gets metioned...

I suppose that a normal consumer computer with one fast processor using top-notch software must be better than the best human player at game/30 minutes (not allowing for anti-comp techniques in this postulation). Can the best human win most matches at G/60? In those terms of G/30, G/60, etc., where do we stand now?

I have a strange problem where my NTFS formatted drive will not accept any more EMD files. I realize this isn't an EMD file problem per se, but hoping that others here have experienced and solved this issue. I use crafty on at times WinXP, FreeBSD, and Linux OS's all accessing this 200GB NTFS partition where I have a TB folder packed with about 110GB of EMD files. A blue screen results if I...

Hi, I just can't seem to understand why R = 3 is better than R = 2 if there's enough remaining depth. What puzzles me is that the search tree for evaluating a null move is quite a lot smaller than the full search tree, even with R = 2. Therefore trying a null-move should be virtually for free. What's then the point of evaluating the null move with further reduced

I noted that, with Shredder classic, there is Sandro Necchi's opening book. In the program's options, there is the possibility of the exportation to the ".pbk" format (Pocket Fritz). Is it possible to convert this book, in a format readable with Chessbase 8, ChessAssistant or ChessPartner? If Yes, how? Obviously, the goal is to use this very good book with such programs. Thanks. Andrea

I have just published a new opening book for the CB-GUI at www.behind.chesslib.no Owners of the opening book "Elect" can have this new PowerBook for free - just e-mail me and ask for the download. It is a "monster book" in more senses than one: the download are 300MB - the book size uncompressed 875MB.

I search a program with which I could make and view chess pgn files in Psion Netbook. Netbook is colour Psion that uses the same engine than Psion 5 and 7. It has also Opera as a web browser. Anything? Toivo Pudas

On Tue, 22 Jun 2004 11:31:32 GMT, Necheva wrote: Oh, and by the way, it's wasn't always 6 million. Before that, it was 60 million, but that number got turned down, then 30, and so on and so on. Can you prove it was 6 million I think not.

Is there a standard way to adjust the time control to account for operator entry of moves when playing one machine against another? I know I could just figure it out and do what works, but what is done during computer tournaments? Or is there even any operator entry even needed nowadays; do they link two computers, each running a chess program, so that they instantly and automatically tell each...