Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: the winner is: Heiner

Author: Reinhard Scharnagl

Date: 15:45:53 07/08/03

Go up one level in this thread


Hi Dieter,

having eliminated the do loop, i got:

lonesome one bit:
Simple   0x20e17a76, time = 2.473
Andrew   0x20e17a76, time = 2.524
Tim      0x20e17a76, time = 1.902
Heiner   0x20e17a76, time = 1.853
Reinhard 0x20e17a76, time = 1.753
switch   0x20e17a76, time = 1.942

up to two one bits:
Simple   0x22589d42, time = 2.664
Andrew   0x22589d42, time = 2.794
Tim      0x22589d42, time = 2.274
Heiner   0x22589d42, time = 2.223
Reinhard 0x22589d42, time = 2.043
switch   0x22589d42, time = 2.453

up to three one bits:
Simple   0x23ca7167, time = 2.904
Andrew   0x23ca7167, time = 3.055
Tim      0x23ca7167, time = 2.654
Heiner   0x23ca7167, time = 2.553
Reinhard 0x23ca7167, time = 2.354
switch   0x23ca7167, time = 2.814

eight random bits:
Simple   0x83001752, time = 4.406
Andrew   0x83001752, time = 4.276
Tim      0x83001752, time = 7.551
Heiner   0x83001752, time = 4.416
Reinhard 0x83001752, time = 5.949
switch   0x83001752, time = 2.163

eight random bits high one probability:
Simple   0xb78285c8, time = 3.685
Andrew   0xb78285c8, time = 3.886
Tim      0xb78285c8, time = 10.565
Heiner   0xb78285c8, time = 4.356
Reinhard 0xb78285c8, time = 8.402
switch   0xb78285c8, time = 2.554

eight one bits 0xff:
Simple   0x0642ac00, time = 0.992
Andrew   0x0642ac00, time = 1.311
Tim      0x0642ac00, time = 13.360
Heiner   0x0642ac00, time = 1.972
Reinhard 0x0642ac00, time = 9.274
switch   0x0642ac00, time = 1.121

void reinhard(int uptoNbits)
{
	int i;
	clock_t start, stop;

	mySeedRand(0);
	n = n1 = n2 = n3 = n4 = n5 = n6 = n7 = n8 = 0;
	start = clock();

	for (i = 0 ; i < MAX_ITERATIONS; i++)
	{
		unsigned long bits = randbits(uptoNbits);
_work:
		{
			switch (bits)			{
			// cases [all odd numbers (with 0x01 matching)]:
			case 0x01: case 0x03: case 0x05: case 0x07:
                 	case 0x09: case 0x0b: case 0x0d: case 0x0f:
			case 0x11: case 0x13: case 0x15: case 0x17:
                 	case 0x19: case 0x1b: case 0x1d: case 0x1f:
			case 0x21: case 0x23: case 0x25: case 0x27:
                	case 0x29: case 0x2b: case 0x2d: case 0x2f:
			case 0x31: case 0x33: case 0x35: case 0x37:
                 	case 0x39: case 0x3b: case 0x3d: case 0x3f:
			case 0x41: case 0x43: case 0x45: case 0x47:
                 	case 0x49: case 0x4b: case 0x4d: case 0x4f:
			case 0x51: case 0x53: case 0x55: case 0x57:
                 	case 0x59: case 0x5b: case 0x5d: case 0x5f:
			case 0x61: case 0x63: case 0x65: case 0x67:
                	case 0x69: case 0x6b: case 0x6d: case 0x6f:
			case 0x71: case 0x73: case 0x75: case 0x77:
                 	case 0x79: case 0x7b: case 0x7d: case 0x7f:
			case 0x81: case 0x83: case 0x85: case 0x87:
                	case 0x89: case 0x8b: case 0x8d: case 0x8f:
			case 0x91: case 0x93: case 0x95: case 0x97:
                     	case 0x99: case 0x9b: case 0x9d: case 0x9f:
			case 0xa1: case 0xa3: case 0xa5: case 0xa7:
                	case 0xa9: case 0xab: case 0xad: case 0xaf:
			case 0xb1: case 0xb3: case 0xb5: case 0xb7:
                 	case 0xb9: case 0xbb: case 0xbd: case 0xbf:
			case 0xc1: case 0xc3: case 0xc5: case 0xc7:
                 	case 0xc9: case 0xcb: case 0xcd: case 0xcf:
			case 0xd1: case 0xd3: case 0xd5: case 0xd7:
                 	case 0xd9: case 0xdb: case 0xdd: case 0xdf:
			case 0xe1: case 0xe3: case 0xe5: case 0xe7:
                 	case 0xe9: case 0xeb: case 0xed: case 0xef:
			case 0xf1: case 0xf3: case 0xf5: case 0xf7:
                	case 0xf9: case 0xfb: case 0xfd: case 0xff:
				handleBit0();
				if (bits &= ~0x01) goto _work;
				break;
			// cases [all numbers left with 0x02 matching]:
			case 0x02: case 0x06: case 0x0a: case 0x0e:
			case 0x12: case 0x16: case 0x1a: case 0x1e:
			case 0x22: case 0x26: case 0x2a: case 0x2e:
			case 0x32: case 0x36: case 0x3a: case 0x3e:
			case 0x42: case 0x46: case 0x4a: case 0x4e:
			case 0x52: case 0x56: case 0x5a: case 0x5e:
			case 0x62: case 0x66: case 0x6a: case 0x6e:
			case 0x72: case 0x76: case 0x7a: case 0x7e:
			case 0x82: case 0x86: case 0x8a: case 0x8e:
			case 0x92: case 0x96: case 0x9a: case 0x9e:
			case 0xa2: case 0xa6: case 0xaa: case 0xae:
			case 0xb2: case 0xb6: case 0xba: case 0xbe:
			case 0xc2: case 0xc6: case 0xca: case 0xce:
			case 0xd2: case 0xd6: case 0xda: case 0xde:
			case 0xe2: case 0xe6: case 0xea: case 0xee:
			case 0xf2: case 0xf6: case 0xfa: case 0xfe:
				handleBit1();
				if (bits &= ~0x02) goto _work;
				break;
			// cases [all bits left with 0x04 matching]:
			case 0x04: case 0x0c:
			case 0x14: case 0x1c:
			case 0x24: case 0x2c:
			case 0x34: case 0x3c:
			case 0x44: case 0x4c:
			case 0x54: case 0x5c:
			case 0x64: case 0x6c:
			case 0x74: case 0x7c:
			case 0x84: case 0x8c:
			case 0x94: case 0x9c:
			case 0xa4: case 0xac:
			case 0xb4: case 0xbc:
			case 0xc4: case 0xcc:
			case 0xd4: case 0xdc:
			case 0xe4: case 0xec:
			case 0xf4: case 0xfc:
				handleBit2();
				if (bits &= ~0x04) goto _work;
				break;
			case 0x08: case 0x18: case 0x28: case 0x38:
			case 0x48: case 0x58: case 0x68: case 0x78:
			case 0x88: case 0x98: case 0xa8: case 0xb8:
			case 0xc8: case 0xd8: case 0xe8: case 0xf8:
				handleBit3();
				if (bits &= ~0x08) goto _work;
				break;
			case 0x10: case 0x30: case 0x50: case 0x70:
			case 0x90: case 0xb0: case 0xd0: case 0xf0:
				handleBit4();
				if (bits &= ~0x10) goto _work;
				break;
			case 0x20: case 0x60: case 0xa0: case 0xe0:
				handleBit5();
				if (bits &= ~0x20) goto _work;
				break;
			case 0x40: case 0xc0:
				handleBit6();
				if (!(bits &= ~0x40)) break;
			case 0x80:
				handleBit7();
			default:
				bits = 0x00;
			case 0x00:
				break;
			}
		}
	}
	stop = clock();
	n = n1 + n2 + n3 + n4 + n5 + n6 + n7 + n8;
	printf("Reinhard 0x%08x, time = %.3f\n", n, (float)(stop - start) /
CLOCKS_PER_SEC);
}

Regards, Reinhard



This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.