Abstract
A new searching approach, Selecten Jumping Searching (SJS), in which the length of every seaching step from a node to another node along a path is much longer than one, has been proposed this paper. In addition to all the problems which can be solved by GPS or MPS, SJS can also solve other problems such as theN Queens problems, theN Puzzle problems, etc., which GPS and MPS fail whenN is large and whose computational complexity are exponential by the general searching approach or MPS. The searching algorithms of SJS, algorithmsC,C 0 (orC ′0 ) andC * whose computational complexity is only polynomial and linear respectively have been proposed also in this paper. Finally, the experimental results of the Five Hundred Queens problem, more than two Thousand Queens problem and theN Puzzle problem (whereN is more than one thousand) are given. In order to get the first some solutions of the Fifty Queens problem and to build the 352−1 Puzzle problem’s Macro Table of MPS, both of them would take 1025 years even using a 1015 ops supercomputer by the general searching approach. But using proposed approach and algorithms (whose computational complexity isO(N) andO(N 3/2) respectively), 4000 solutions of the Five Hundred Queens problem have been got when program runs about 227 minutes on HP 9000/835 and the average solution time to solve the 352−1 Puzzle problem with arbitrary problem state is less than one minute on HP 9000/300. SJS is a searching approach as a result mapped from Macro Transformation approach.
Similar content being viewed by others
References
Gao, Q. S., Cheng, H. D., Suen, C. Y. and Li, L. H., “A New Approach to Produce Algorithms for Solving Non-serializable and Indecomposable Problems,”Proc. of 1st International Symposium on Artifial Intelligence, Monterrey, Mexico, pp. 305–335, 1988.
Gao, Q. S., Cheng, H. D., “Combination of Macro-Transform with General Problem-Solving Methods Used by Human Beings,”Proc. of 1989 International Symposinm Computational Intelligence, Milano, Italy, 1989.
Gao, Q. S. and Cheng, H. D., “Macro-Transform Approach to Solve Indecomposable Problems,”Proc. of 1989 IEEE International Workshop on Tools for Artificial Intelligence, Herndon, USA, 1989.
Gao, Q. S., Cheng, H. D. and Li, L. H., “Learning by Analysing the Difference of Similar Problems,”Proc. of the 4th International Symposium on Knowledge Engineering, Barcelona, Spain, 1990.
Gao, Q. S., Cheng, H. D., Suen, C. Y. and Li, L. H., “Macro-Transform: A new Approach to Problem Solving,”Proc. of International Computer Science Conference ’88, Hong Kong, pp. 381–386, 1988.
Newell, A. and Ernst, G. W.,GPS: A Case Study in Generality and Problem Solving, Academic Press, New York, 1969.
Newell, A. and Simon, H. A., “GPS, A Program that Simulates Human Thought,” inComputer and Thought (E. A. Feigenbaum and J. Feldman, ed.), McGraw-Hill Press, New York, 1963.
Newell, A., Shaw, J. C. and Simon, H. A., “A Variety of Intelligent Learning in General Problem Solver,” inSelf-Organizing Systems (M. C. Yovit and S. Cameron, ed.), Pergamon Press, Oxford, 1960.
Ernst, G. W., “Sufficient Conditions for the Success of GPS,”JACM, 16, 1969.
Korf, R. E., “A Program that Learns to Solve Rubik’s Cube,”National Conference of Artificial Intelligence, Pittsburg, PA, Aug. 1982.
Korf, R. E., “Operator Decomposability: A New Type of Problem Structure,”National Conference of Artificial Intelligence, Washington, DC, Aug. 1983.
Korf, R. E. “Macro-Operator: A Week Method for Learning,”Artificial Intelligence,Vol. 26,No. 1, 1985.
Korf, R. E., “Learning to Solve Problems by Searching for Macro-Operators,”Pitman Advanced Publishing Program, 1985.
Lba, G. A., “Learning by Discovering Macros in Pussle Solving,”Proc. of the 9th International Joint Conference on Artificial Intelligence, Aug. 1985.
Laird, J., Rosenbloom, P. and Newell, A.,Universal Subgoaling and Chunking, Klower Academic Publisher, 1986.
Gao, Q. S. and Hou, S. J., “Junior Researcher: A Discovery System that Can Solve theN Queens Problems (N≥4), on a Constant Computational Complexity,”Proc. of 5th Jerusalem Conference on Information Technology, Jerusalem, Israel, 1990.
Author information
Authors and Affiliations
About this article
Cite this article
Gao, Q.S., Li, L.H. The principle of Selecten Jumping Searching andC,C ′0 ,C * algorithms. New Gener Comput 9, 81–104 (1991). https://doi.org/10.1007/BF03037152
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF03037152