Informed Search Using Equivalent-Class Templates
نویسندگان
چکیده
Many of the search techniques used in AI were developed, studied and/or optimized in the context of game playing. Game playing demands efficient methods and has the advantage that the testing and evaluation of different implementations is straightforward, for it requires playing the game. This paper provides a case study of an informed search technique applied for a non-adversarial game (triangular board Peg Game). The performance of the method is compared with other strategies that were tried. In addition, conclusions about the peg game are presented.
منابع مشابه
Some New Properties of the Searching Probability
Consider search designs for searching one nonzero 2- or 3-factor interaction under the search linear model. In the noisy case, search probability is given by Shirakura et al. (Ann. Statist. 24(6) (1996) 2560). In this paper some new properties of the searching probability are presented. New properties of the search probability enable us to compare designs, which depend on an unknown parameter ?...
متن کاملDecision support telemedicine systems: A conceptual model and reusable templates.
Decision support telemedicine systems (DSTSs) are systems combining elements from telemedicine and clinical decision support systems. Although emerging more, these types of systems have not been given much attention in the literature. Our objective is to define the term DSTS, to propose a general DSTS model, and to propose model-based templates to aid DSTS development for three medical tasks. T...
متن کاملTALE proteins search DNA using a rotationally decoupled mechanism.
Transcription activator-like effector (TALE) proteins are a class of programmable DNA-binding proteins used extensively for gene editing. Despite recent progress, however, little is known about their sequence search mechanism. Here, we use single-molecule experiments to study TALE search along DNA. Our results show that TALEs utilize a rotationally decoupled mechanism for nonspecific search, de...
متن کاملLearning Equivalence Classes of Bayesian Network Structures
Two Bayesian-network structures are said to be equivalent if the set of distributions that can be represented with one of those structures is identical to the set of distributions that can be represented with the other. Many scoring criteria that are used to learn Bayesiannetwork structures from data are score equivalent; that is, these criteria do not distinguish among networks that are equiva...
متن کاملA Q2P: Discovering Query Templates via Autocompletion
We present Q2P, a system that discovers query templates from search engines via their query autocompletion services. Q2P is distinct from the existing works in that it does not rely on query logs of search engines that are typically not readily available. Q2P is also unique in that it uses a trie to economically store queries sampled from a search engine and employs a beam-search strategy that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000