1 Modifications by Christian Zmasek
2 ---------------------------------
5 !WARNING: Use this modified version of TREE-PUZZLE 5.0 ONLY
6 together with FORESTER/RIO!
8 !For all other puposes download the excellent original!
15 puzzle1.c: void putdistance(FILE *fp):
17 remove: "/* seven in one row */
18 if ((j + 1) % 7 == 0 && j+1 != Maxspc)
25 puzzle1.c: int main(int argc, char *argv[]):
28 "FPRINTF(STDOUTFILE "Writing parameters to file %s\n", OUTFILE);
29 openfiletowrite(&ofp, OUTFILE, "general output");
30 writeoutputfile(ofp,WRITEPARAMS);
33 "openfiletoappend(&ofp, OUTFILE, "general output");
34 writeoutputfile(ofp,WRITEREST);"
36 "openfiletoappend(&ofp, OUTFILE, "general output");
37 writeoutputfile(ofp,WRITEREST);"
39 "openfiletoappend(&ofp, OUTFILE, "general output");
40 writeoutputfile(ofp,WRITEREST);"
48 puzzle2.c: void getsizesites(FILE *ifp):
54 puzzle2.c: void readid(FILE *infp, int t):
56 for (i = 0; i < 10; i++) { -> for (i = 0; i < 26; i++) {
58 for (i = 9; i > -1; i--) { -> for (i = 25; i > -1; i--) {
60 for (j = 0; (j < 10) && (flag == TRUE); j++) -> for (j = 0; (j < 26) && (flag == TRUE); j++)
64 puzzle2.c: void initid(int t):
66 Identif = new_cmatrix(t, 10); -> Identif = new_cmatrix(t, 26);
68 for (j = 0; j < 10; j++) -> for (j = 0; j < 26; j++)
72 puzzle2.c: fputid10(FILE *ofp, int t):
74 for (i = 0; i < 10; i++) -> for (i = 0; i < 26; i++)
78 puzzle2.c: int fputid(FILE *ofp, int t):
80 while (Identif[t][i] != ' ' && i < 10) { -> while (Identif[t][i] != ' ' && i < 26) {
85 ml2.c: Node *internalnode(Tree *tr, char **chpp, int *ninode):
87 char ident[100], idcomp[11]; -> char ident[100], idcomp[27];
89 idcomp[10] = '\0'; -> idcomp[26] = '\0';
91 } while (!stop && (ff != 10)); -> } while (!stop && (ff != 26));