---
title: "A Weighted Technique in Heuristic Search"
authors:
  - "Bo Zhang"
  - "Ling Zhang"
doi: ""
url: "https://ijcai.org/proceedings/1985/209"
pdf: "https://ijcai.org/proceedings/1985/0209.pdf"
venue: "Proceedings of the Ninth International Joint Conference on Artificial Intelligence"
year: 1985
pages: "1037-1038"
track: "Planning and Search"
keywords:
---

# A Weighted Technique in Heuristic Search

Bo Zhang, Ling Zhang

*Proceedings of the Ninth International Joint Conference on Artificial Intelligence*, pages 1037-1038.

## Abstract

As shown in (1), we examine search as a statistic sampling proce s s. Based on some statistical infe rence method the probability that a subtree in search tree conteins the goal can be decided . Th us some weight is intentionaly added to the evaluation function of those nodes which are unlikely in the solution path so that the search will concentrate on the most promising p a th. It results in a new weig hte d a lgorithm-WSA. In a uniform m- ary tree, we show that a goal can be found by WSA in the polynomial time, although tßN computational complexity of A (or A*) may be O(e ) for searching the same space. Where N is the depth at which the goa l i s loc ated.