Author: leonid
Date: 22:21:00 10/16/99
Go up one level in this thread
On October 16, 1999 at 19:26:57, Jeremiah Penery wrote: >On October 16, 1999 at 17:51:46, leonid wrote: > >>To put in the chain of moves first the moves that give the check is simple - >>those moves can lead to the mate. Mate stop all the thinking, once the highest >>possible value is achieved. > > >It is true that these moves can lead to mate, but not very often. In fact, most >of these moves will be useless. Take this example: 1. e4 e5 2. Bc4 Nf6, then >the move Bxf7 is a check, but it is completely useless. I suspect this will be >the case for most checking moves. >My guess is that sorting moves first because they give check probably won't give >good results compared to other orderings. > >> Looking through the "tool" I found that the number >>of moves that lead to check is very small. This is the next reason for leaving >>those moves at the head of the chain. > > >This is true, but if the first move is very bad, you still have to search it >fully. Like in my Bxf7 example above, that is a bad checking move, but you >would still have to search it fully before searching other moves. This will be >bad for the branching factor in your program. > >>I looked into your description of the move ordering and I hope that I understood >>correctly everything that you have said. It is probable that our move ordering >>is very close but we explain it in a different fashion. >> >>Languages that we use are not the same. Mine is Assembler. Until now wrote >>everything for DOS but prepare to rewrite everything for Windows. And for what >>system you write? Or probably Java is already perfect for every system? > > >It's quite difficult to write a program in assembler, as it makes it difficult >to easily modify. I wish you luck. :) > >Jeremiah Maybe what you say about the deposition of the checking moves at the head of the chain is true, everything is possible. But after trying that I did with many positions in the past all the time deposition of the cheching moves at the head give better result. This is my statistic. But it is still possible that my statistics is now old. Actually, after each change in the movesodering everything must be tryed once again. Assembler is not that difficult as everybody think. In reality, when you use to it you find it the most simple and easy language to use. And even when you use the Assembler you are often use your own procedures that are just like in high languages, only you knows exactly how they work because you wrote them on your own. Windows programming on Assembler is nightmare. Almost complet obsence of lliterature on the subject. Secretive Microsoft mafia to which you must pay initial 500$ for SDK (Sofware Development Kit). You simply can't start your programming by buying only your dear Assembler, like it was only few years when you was still young and your pocket was full of money... Leonid.
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.