A PROGRAM FOR SOLVING WORD SUM PUZZLES

被引：2

作者：

BURSTALL, RM

机构：

[1] Department of Machine Intelligence and Perception, University of Edinburgh

来源：

COMPUTER JOURNAL | 1969年 / 12卷 / 01期

关键词：

D O I：

10.1093/comjnl/12.1.48

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper describes a program for solving a class of 'word sum' or 'cryptarithm' puzzles by a heuristic tree searching method. Formally the problem is to solve a set of simultaneous linear inequalities with the variables taking integer values. © 1969 The British Computer Society.

引用

页码：48 / &

共 12 条

[1] SURVEY OF INTEGER PROGRAMMING
BEALE, EML
[J]. OPERATIONAL RESEARCH QUARTERLY, 1965, 16 (02) : 219 - 228
[2] BROOKES M, 1964, 150 PUZZLES CRYPTARI
[3] BURSTALL RM, 1967, MACH INTELL, V1, P65
[4] BURSTALL RM, 1965, 10 U ED DEP MACH INT
[5] EXPERIMENTS WITH GRAPH TRAVERSER PROGRAM
DORAN, JE
MICHIE, D
[J]. PROCEEDINGS OF THE ROYAL SOCIETY OF LONDON SERIES A-MATHEMATICAL AND PHYSICAL SCIENCES, 1966, 294 (1437): : 235 - &
[6] BACKTRACK PROGRAMMING
GOLOMB, SW
BAUMERT, LD
[J]. JOURNAL OF THE ACM, 1965, 12 (04) : 516 - &
[7] Gomory Ralph E., 1963, RECENT ADV MATH PROG, P269
[8] GRAVES RL, 1963, RECENT ADVANCES MATH, P269
[9] HART PE, 1967, FORMAL BASIS HEURIST
[10] AN ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM
LITTLE, JDC
MURTY, KG
SWEENEY, DW
KAREL, C
[J]. OPERATIONS RESEARCH, 1963, 11 (06) : 972 - 989

← 1 2 →