Author: leonid
Date: 17:26:05 01/02/01
Go up one level in this thread
On January 02, 2001 at 16:32:23, Severi Salminen wrote: >On January 02, 2001 at 10:00:37, leonid wrote: > >>On January 02, 2001 at 09:18:56, Severi Salminen wrote: >> >>>Hi! >>> >>>My program is now running stable and I'd like to test it a little more. Where >>>could I download good quality (only one clear solution) tactical positions. I'd >>>like to have both mating positions and positions where one can win material. >>> >>>Severi >> >>If you will be interested in inevitable mate containing positions, just say me >>this. Disgracefully I don't remember by heart address where I have more than >>1000 mate containg positions. They are on Web site of my friend. Partially they >>are from different book and in big part invented by me when I wrote my mate >>solver. You could see them only through my program that is on the site. Soving >>mate positions is idial for spotting mistakes in move generator. > >That is very true! I have programmed my engine maybe 3-4 weeks and still had a >bug in move generator. So, where could I download them? Or can you send them to >me as an attachment (warn me if they are >100Kb)? > >Severi Address is: http://www.theparticale.com/ There you will go into chess section. I don't remember what is the size of mate positions. It was done around 3 years ago. Chess program that contain chess solver is only around 60k. Chess solver is in finished state (it was done not in three months but in three years) and perfect. You could even create every possible mate containing position very quickly by using unique, speedy selective search. Later you can find optimal number of moves through brute force level. Brute force - see all possible mates for given position. Using brute force solver you will have perfect tool for spotting all possible mistakes in your generator. All the best in your work!!!! 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.