Research on Knight Covering Based on Breadth First Search Algorithm

Abstract:

This paper introduces the general process of the search algorithm Structure through the knight problem. According to the characteristics of the problem, we detailed discuss the DFS(Depth First Search) algorithm and BFS(Breadth First Search) algorithm, and combine the two algorithms together to solve the knights coverage problem. This article has a good reference for the mixed-use scenarios which requires a variety of search algorithms.Algorithms is always the core of Computer programming modeling. Computer algorithm algorithms describes in detail how a computer will enter into the process of output required step by step, or, is a detailed description of the calculation process executing on a computer. The algorithm components include: the accuracy of algorithm, the specific steps of practical algorithm, the execution order of correct, fast and effective algorithm, there is no infinite loop, no matter how complex the algorithm is. The Following will analyze and study BFS, taking Knight Covering as examples.

• Periodical: Applied Mechanics and Materials (Volume 686)
• Pages: 377-380
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.686.377
• Online since: October 2014
• Authors: Feng Wei
• Keywords: Breadth First Search (BFS), Depth-First Search (DFS), Search Algorithms

References

[1] Li Qilin; Zheng we; Zhou Mingtian; Research on Dynamic Unified Schedule Algorithm for Applying Master-Worker Dynamic Unified Schedule Algorithm [A]; 2008' Chinese information technology and Application Forum Paper Compilation [C]; (2008).

[2] Chen Yanjin; The MapReduce Model Research and Improvement of Job Scheduling Algorithms in Hadoop Platform; South China University of Technology (2011).

[3] Hong Yanwei; Laijuan; Yangbin; Determination of the feasibility and Implementation based on EDF Algorithm [J]; Computer Technology and Development; 2006(11).

[4] ShiJun, The text Contains Reasoning and Its Application in Information Retrieval[D] Shanghai Jiao Tong University; (2013).

[5] Xinyu; Ding Yuewei; Chen Zhihao; Automatic Computing System Based on Syntax Tree and Operator Precedence. [J] Shanghai University of Technology; 2003(3).

[6] Zhao Chunyan; Research and Implementation of Job Scheduling Algorithm in Cloud Computing[D]. Bei Jing Jiao Tong University; (2009).

[7] Zhang Mimi; Analysis of the MapReduce model performance in the Hadoop and improvement[D]; University of Electronic Science and Technology of China; (2010).

[8] Zhang Shuguang, Ye Yunfeng; Li Xiaodong; Zhao Jijun; Analysis of RWA algorithm design of wavelength routed optical networks, Study On Optical Communications; 2009(5).