Teorth: Fix bugs in code

2009-06-10T02:14:42Z

Fix bugs in code

← Older revision		Revision as of 19:14, 9 June 2009
Line 956:		Line 956:
	}		}

	printf("Number of 3D Moser sets: %ld", num_linefree);		printf("Number of 3D Moser sets: %ld\n", num_linefree);
	// checksum		// checksum
	for (aa=0; aa<9; aa++)		for (aa=0; aa<9; aa++)
Line 1,042:		Line 1,042:
	// printf("%d ", best);		// printf("%d ", best);
	}		}

	// printf("\n");		// printf("\n");
	}		}
Line 1,134:		Line 1,133:
	crush[i]=j;		crush[i]=j;

	~~// printf("~~(~~%o %o) ",~~ i, crush[i]);		if (i == crush[i])
	if (i ~~== crush[i]~~) count++;		{
			printf("%d ", i);
			count++;
			}

	}		}
Line 1,146:		Line 1,148:
	long forb, forb_base;		long forb, forb_base;

	output = fopen("lookup.dat", "w");		output = fopen("lookup.dat", "wb");
	// srand ( time(NULL) );		// srand ( time(NULL) );

Line 1,155:		Line 1,157:
	init_data();		init_data();

			// test(0);
			// test(1);

			// return;

	for(i=0; i<4096; i++)		for(i=0; i<4096; i++)
Line 1,166:		Line 1,172:
	l >>=1;		l >>=1;
	}		}
			// printf("\n Testing row %d \n", i);
	for (j=0; j<16384; j++)		for (j=0; j<16384; j++)
	{		{
Line 1,173:		Line 1,180:
	{		{
	if (l & 1) forb \|= pow2[ac[k]];		if (l & 1) forb \|= pow2[ac[k]];
			l >>=1;
	}		}
	// forb is now a min-random set with no 222		// forb is now a min-random set with no 222

Teorth: New page: #include #include #include #include #define NUM_LINES_3D 25 // 25 non-horizontal lines in [3]^3 // the bitmasks of the 25 lines in [3]^3 const l...

2009-06-08T16:58:39Z

New page: #include <stdio.h> #include <stdlib.h> #include <string.h> #include <time.h> #define NUM_LINES_3D 25 // 25 non-horizontal lines in [3]^3 // the bitmasks of the 25 lines in [3]^3 const l...

Show changes

Lookup table C code - Revision history

Teorth: Fix bugs in code

Teorth: New page: #include #include #include #include #define NUM_LINES_3D 25 // 25 non-horizontal lines in [3]^3 // the bitmasks of the 25 lines in [3]^3 const l...