114网址导航Options for accessing this content: If you are a society or association member and require assistance with obtaining online access instructions please contact our Journal Customer Services team.
If your institution does not currently subscribe to this content, .Login via other institutional login options .You can purchase online access to this Article for a 24-hour period (price varies by title)
If you already have a Wiley Online Library or Wiley InterScience user account: login above and proceed to purchase the article.New Users: Please register, then proceed to purchase the article.
Search for your institution's name below to login via Shibboleth.
Registered Users please login:
Access your saved publications, articles and searchesManage your email alerts, orders and subscriptionsChange your contact information, including your password
Please register to:
Save publications, articles and searchesGet email alertsGet all the benefits mentioned below!This page uses JavaScript to progressively load the article content as a user scrolls.
Screen reader users, click the load entire article button to bypass dynamically loaded article content.
PasswordRemember meSign in via your institutionSign in via your institution
&RIS&(for EndNote, Reference Manager, ProCite)
&RefWorks Direct Export
& Citation Only
& Citation and Abstract
JavaScript is disabled on your browser.
Please enable JavaScript to use all the features on this page.
JavaScript is disabled on your browser.
Please enable JavaScript to use all the features on this page. This page uses JavaScript to progressively load the article content as a user scrolls. Click the View full text link to bypass dynamically loaded article content.
, January 2000, Pages 59-76
Forward pruning and other heuristic search techniques in tsume go
Department of Computer Science, Queen Mary & Westfield College, University of London, Mile End Road, London E1 4NS, UKGoTools is the name of a computer program to analyse life and death fights in the game of go. First, a motivation for programing go is given. General aspects of the heuristic search performed in GoTools are discussed. The absolute strength and the effect of forward tree pruning are tested in a competition between GoTools and dan level human players. It is found that with a speed up of a factor of 30 the program still finds for 70% of the problems of a test set the correct first move. A suggestion is made to compare intelligence between contestants (in solving fully enclosed life/death problems) by comparing their relative increase in the time to solve problems with the increase of the difficulty of the problems. The rules of go are explained in the shortest possible form in .
No articles found.
This article has not been cited.
No articles found.