ScholarLens Back to search
2011•Luoyang Shifan Xueyuan xuebaoRequires access

Searching Algorithms Comparison of the Eight Digital Problem

Ouyang Lin-yan

Open publisher page 1 citations

Abstract

Search strategy is one of the main directions in the artificial intelligence research.Using different search strategies in the process of solving problem also may have differences.Through the analysis of the search solution for eight digital,the Breadth-first search algorithm,a kind of the blind searching,and A * algorithm,which is one of the heuristic search,are used to implement it.Breadth-first search algorithm and A * algorithm are compared to evaluate the superiority between these two search algorithms.

About this research paper

What this paper is about

Search strategy is one of the main directions in the artificial intelligence research.Using different search strategies in the process of solving problem also may have differences.Through the analysis of the search solution for eight digital,the Breadth-first search algorithm,a kind of the blind searching,and A * algorithm,which is one of the heuristic search,are used to implement it.Breadth-first search algorithm and A * algorithm are compared to evaluate the superiority between these two search algorithms.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Search strategy is one of the main directions in the artificial intelligence research.Using different search strategies in the process of solving problem also may have differences.Through the analysis of the search solution for eight digital,the Breadth-first search algorithm,a kind of the blind searching,and A * algorithm,which is one of the heuristic search,are used to implement it.Breadth-first search algorithm and A * algorithm are compared to evaluate the superiority between these two search algorithms.

Key concepts: Best-first search, Beam search, Beam stack search, Search algorithm, Incremental heuristic search, Computer science, Iterative deepening depth-first search, Algorithm

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Searching Algorithms Comparison of the Eight Digital Problem — Research Paper | ScholarLens