View Single Post
  #18  
Old July 11th 03, 11:22 PM
Neil Fernandez
external usenet poster
 
Posts: n/a
Default Relative strength of best programs at chess/Chinese chess/go

In article s.co.uk,
Chris Lawrence writes

On Fri, 11 Jul 2003, Neil Fernandez wrote:

In addition it would be wrong to assume that there is no game with a
clearly defined and finite state space at which no computer programs
will be _able_ to play as strongly as the strongest humans can, even
with lots of processing power and parallel processing.


I've never claimed it is not possible or that it will never be possible.
Merely that it is not possible today and processing power is not the
stumbling block.


My own view is that there are or will be games at which humans will
always be able to thrash computer programs (or would be able to do so if
such programs got written) - call me an optimist! :-)

When we play Go we are using a lot of gut-feeling, intuition, visual
effect, experience, reading, etc. Some of those things can be
represented or effected in today's computers. Others cannot.

We need to a) understand what happens when we think about things, b)
create a computer with a more suitable architecture on which to map
those processes and c) understand the thoughts which take place in Go
and map those onto b).


....if one shares the aim of programming computers to beat humans.

Neil

--
Neil Fernandez
Ads
 

Loans - Remortgages - Mortgage Calculator - Mortgage - Car Loan