Author: Pete Galati
Date: 14:14:35 11/10/99
Go up one level in this thread
On November 10, 1999 at 14:05:38, Dann Corbit wrote: >On November 10, 1999 at 12:27:57, Pete Galati wrote: > >>On November 10, 1999 at 04:20:21, Bas Hamstra wrote: >> >>>It looks like threads will be continually created and destroyed. Doesn't that >>>give a lot of overhead? >>> >>>Regards, >>>Bas Hamstra. >> >>Are you complaining about something? I don't follow what you're saying. > >I shall be only too happy to receive any and all criticism about my model. >Since I am just gathering and benchmarking algorithms and data structures at >this point, I am still in the design phase. The old saying is, "Measure twice >and cut once." > >If there are serious flaws in my model, I would love to hear about them and be >only too glad to receive them. There are literally dozens of experts here who >know a hundred times more about chess programming than I do. I would not be >surprised if my ideas have already been tried (although I have not seen them >published anywhere). > >One of the main reasons I want to talk about my ideas is so that the chess >programming experts here can tell me what a drooling idiot I am. Then, I can >wipe the spittle off of my chin before it gets on my necktie. > >Any good idea will withstand criticism. And the criticism will make it better. >By making observations about the flaws, I can: >0. Fix the problems by following the advice given >1. Fix the problems by my own new ideas >2. Partition off the problem area into a separate design change >3. Change my approach altogether > >or something else. In any case, I hope that those that know better will tell me >every stupid flaw my plan contains. Tell me the limits I will face. Tell me >the places where it fails. Tell me the fundamental errors in my thinking. > >"Beat me! Spank me! Make me write bad checks! But please respect me!" >;-) Sorry, I got carried away there. Maybe we need a new poll question at CCC, "Who do you think is the kinkiest Chess programmer?" with a list of names, and then the abstain option. Pete
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.