Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: more examples for search-based stupidity

Author: Hristo

Date: 15:11:56 06/14/98

Go up one level in this thread


Bruce is correct ... I have my bananas and you have your oranges ...
:)))

>
>No, I don't believe there is a viable alternative to "search" since we
>"humans" rely on exactly the same idea.  And if *we* have to search to
>find tactical wins, the computers are obviously going to follow that
>same path.

Bob Hyatt = Lord Kelvin ... :)))
"The Earth can not be more than 100 000 000 years old. All evidence and
physical(thermodinamics) laws confirm this!"

There are many places in life where common sence doesn't present the
nature of the world. If we stay within the "common sence" we are bound
to be misleaded.

Bob, I hope you are not so rigid! It seems as if you have
mental-rigomordus in the prime of life(you are very bright, but...).
Your argument doesn't contain much value, other than the fact the we are
all subjective, and that we evaluate the world through our own
experiances.


Crafty must evaluate a position based on something else but the search
through the tree of possible moves. For instance after 1. f3 crafty
plays 1 ... e5. Now how is this happening?! There is no forced win of
any sort yet Crafty plays, probably, the best move. It is also highly
unlikely that crafty actualy searches all possible moves. Crafty doesn't
evaluate the position as 0.00 ...
there is some sort of artificial evaluation there.
Mister Thorsten point was that instead of searching a huge tree of
improbable moves, and then applying some "bogus" evaluation function,
one can spend more time "filtering" out the so called "stupid" moves.
This "filtering" will depend on another "bogus" evaluation function ...
is it possible to have an "objective" evaluation function?
Is this within our grasp? Perhaps!

Take a distant look at your "tree-of-moves". It looks as if you have
created a possible data stream in the time-domain out of a single
position. Then you are trying to reconstruct the original position and
determine what is the most probable frequency content of this position.
The best move keeps or expands your energy!(The problem is you don't
look at it this way, although this is what is happening.) The original
position already contains the "frequency" infromation, one have to learn
how to extract it whithout going to time-domain and back.

Best regards.
Hristo






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.