Author: Frank Phillips
Date: 12:20:16 12/07/02
Go up one level in this thread
On December 07, 2002 at 14:03:04, Walter Faxon wrote: >On December 07, 2002 at 06:33:00, Frank Phillips wrote: > >> >>Has anybody posted Walter's method with the table for 0 == highest order bit? >> >>Frank > > >Just replace every listed value with 63-value, viz.: > >// Version for high-order bit numbered 0, low-order bit numbered 63. >const u8 LSB_64_table[154] = > { >#define __ 0 > 40,__,__,__,32,__,__,24,44,__, 46,47,45,__,16,53,43,54,55,52, > 62,63,61, 6, 7, 5,60,51,__, 4, __,__,42,__,59,__,__, 3,__,__, > __,__,__,50,__,__,__,__,__,__, 58,__,__, 2,__,__,__,__,__,__, > __,__,__,__,41,__,__,__,33,__, __,25,__,__,__,49,__,__,17,__, > __,__,57,__,__, 1,__,__,__, 9, __,__,__,__,__,__,__,__,__,__, > 34,__,__,26,__,__,__,__,__,__, 18,__,__,__,__,__,35,__,__,27, > __,10,__,__,36,__,19,28,37,39, 38,29,31,30,20,23,22,11,21,48, > __,13,15,14,__,12,56,__,__, 0, __,__,__, 8 >#undef __ > }; > > >-- Walter Thanks Frank
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.