Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Is this a record?

Author: Albert Silver

Date: 15:00:02 05/12/00

Go up one level in this thread


On May 12, 2000 at 06:23:04, Graham Laight wrote:

>On May 12, 2000 at 05:36:40, Dann Corbit wrote:
>
>>On May 12, 2000 at 05:22:45, Jouni Uski wrote:

>I think it is interesting in terms of categorising programs as either brute
>force or knowledge based (though just because you're slow, that doesn't
>necessarily mean that you're clever).

I couldn't agree more. I never assumed being slow was in fact clever.

>
>>MCP8, Diep, CS-Tal and others will get several orders of magnitude less nodes
>>than that.  But they are equal or better at playing chess.
>>
>>Go figure.
>
>What Dann seems to be saying is that a program with a high NPS per megahertz
>could have a "search knowledge profile" something like this:
>
> ply |-------------------------------------------------------------|
>     |                        $$$                 #                |
>25   |                        $$$                 #                |
>     |             #                             ##                |
>20   |            ##                          #######              |
>     |        ########                     #############           |
>15   |     ##############               ####################       |
>     | ######################        ###########################   |
>10   |#############################################################|
>     |#############################################################|
>5    |#############################################################|
>     |#############################################################|
>     |-------------------------------------------------------------|
>
>                         Breadth of knowledge
>
>Where the # represents good knowledge, and the $ represents areas where the
>knowledge would be most valuable in this particular position.
>
>However, in the same position, slower searching (but more knowledge
>rich)programs that play equally well might have a profile more like this one:

Nice try but we know the truth:

>
> ply |-------------------------------------------------------------|
>     |     ~     ~     ~   $$~     ~     ~     ~     ~     ~     ~ |
>25   |  ~    ~    ~    ~   ~$$ ~   ~   ~   ~   ~   ~   ~   ~   ~  ~|
>     |~   ~   ~   ~   ~   ~   ~   ~   ~   ~   ~   ~   ~   ~   ~   ~|
>20   | ~  ~  ~  ~  ~  ~  ~  ~  ~  ~  ~  ~  ~  ~  ~  ~  ~  ~  ~  ~  |
>     |~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~|
>15   | ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ ~~ |
>     |~~~ ~~~ ~~~ ~~~ ~~~ ~~~ ~~~ ~~~ ~~~ ~~~ ~~~ ~~~ ~~~ ~~~ ~~~ ~|
>10   |~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~|
>     |~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~|
>5    |#############################################################|
>     |#############################################################|
>     |-------------------------------------------------------------|
>
>                    Screenshot of D-Day on the ZX-81


- $ represents the ships
- ~ rperesents the water
- # represents the beachhead

Pretty cool, got any more?

                                      Albert Silver





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.