1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
|
/**CFile****************************************************************
FileName [extraUtilCube.c]
SystemName [ABC: Logic synthesis and verification system.]
PackageName [extra]
Synopsis [Permutation computation.]
Author [Alan Mishchenko]
Affiliation [UC Berkeley]
Date [Ver. 1.0. Started - June 20, 2005.]
Revision [$Id: extraUtilCube.c,v 1.0 2003/02/01 00:00:00 alanmi Exp $]
***********************************************************************/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include "misc/vec/vec.h"
#include "misc/vec/vecHsh.h"
ABC_NAMESPACE_IMPL_START
////////////////////////////////////////////////////////////////////////
/// DECLARATIONS ///
////////////////////////////////////////////////////////////////////////
static inline void Abc_StatePush( Vec_Int_t * vData, char * pState, int k ) { int i; for ( i = 0; i < 6; i++ ) Vec_IntWriteEntry(vData, 6*k+i, ((int*)pState)[i]); }
static inline void Abc_StatePerm( char * pState, char * pPerm, char * pRes ) { int i; for ( i = 0; i < 24; i++ ) pRes[i] = pState[(int)pPerm[i]]; }
static inline void Abc_StatePrint( char * pState ) { int i; for ( i = 0; i < 24; i++ ) printf(" %2d", pState[i]); printf( "\n" ); }
////////////////////////////////////////////////////////////////////////
/// FUNCTION DEFINITIONS ///
////////////////////////////////////////////////////////////////////////
/**Function*************************************************************
Synopsis []
Description []
SideEffects []
SeeAlso []
***********************************************************************/
void Abc_EnumerateCubeStates()
{
int pXYZ[3][9][2] = {
{ {3, 5}, {3,17}, {3,15}, {1, 6}, {1,16}, {1,14}, {2, 4}, {2,18}, {2,13} },
{ {2,14}, {2,24}, {2,12}, {3,13}, {3,23}, {3,10}, {1,15}, {1,22}, {1,11} },
{ {1,10}, {1, 7}, {1, 4}, {3,12}, {3, 9}, {3, 6}, {2,11}, {2, 8}, {2, 5} } };
Vec_Int_t * vData = Vec_IntStart( 6 * (1 << 22) );
Hsh_IntMan_t * vHash = Hsh_IntManStart( vData, 6, 1 << 22 );
int i, k, v, RetValue, Beg, End, Counter = 0;
char pStart[24], pFirst[9][24];
abctime clk = Abc_Clock();
printf( "Enumerating states of 2x2x2 cube.\n" );
// init state
for ( v = 0; v < 24; v++ )
pStart[v] = v;
Abc_StatePush( vData, pStart, Counter );
RetValue = Hsh_IntManAdd( vHash, Counter );
assert( RetValue == Counter );
Counter++;
// first nine states
for ( i = 0; i < 3; i++ )
{
memcpy( pFirst[i], pStart, 24 );
for ( v = 0; v < 9; v++ )
ABC_SWAP( char, pFirst[i][pXYZ[i][v][0]-1], pFirst[i][pXYZ[i][v][1]-1] );
Abc_StatePush( vData, pFirst[i], Counter );
RetValue = Hsh_IntManAdd( vHash, Counter );
assert( RetValue == Counter );
Counter++;
//Abc_StatePrint( pFirst[i] );
memcpy( pFirst[3+i], pFirst[i], 24 );
for ( v = 0; v < 9; v++ )
ABC_SWAP( char, pFirst[3+i][pXYZ[i][v][0]-1], pFirst[3+i][pXYZ[i][v][1]-1] );
Abc_StatePush( vData, pFirst[3+i], Counter );
RetValue = Hsh_IntManAdd( vHash, Counter );
assert( RetValue == Counter );
Counter++;
//Abc_StatePrint( pFirst[3+i] );
memcpy( pFirst[6+i], pFirst[3+i], 24 );
for ( v = 0; v < 9; v++ )
ABC_SWAP( char, pFirst[6+i][pXYZ[i][v][0]-1], pFirst[6+i][pXYZ[i][v][1]-1] );
Abc_StatePush( vData, pFirst[6+i], Counter );
RetValue = Hsh_IntManAdd( vHash, Counter );
assert( RetValue == Counter );
Counter++;
//Abc_StatePrint( pFirst[6+i] );
}
printf( "Iter %2d -> %8d ", 0, 1 );
Abc_PrintTime( 1, "Time", Abc_Clock() - clk );
printf( "Iter %2d -> %8d ", 1, Counter );
Abc_PrintTime( 1, "Time", Abc_Clock() - clk );
Beg = 1; End = 10;
for ( i = 2; i <= 100; i++ )
{
if ( Beg == End )
break;
for ( k = Beg; k < End; k++ )
for ( v = 0; v < 9; v++ )
{
Abc_StatePerm( (char *)Vec_IntEntryP(vData, 6*k), pFirst[v], (char *)Vec_IntEntryP(vData, 6*Counter) );
RetValue = Hsh_IntManAdd( vHash, Counter );
if ( RetValue == Counter )
Counter++;
if ( Counter == (1<<22) )
{
printf( "Did not converge. " );
Abc_PrintTime( 1, "Time", Abc_Clock() - clk );
return;
}
}
Beg = End; End = Counter;
printf( "Iter %2d -> %8d ", i, Counter );
Abc_PrintTime( 1, "Time", Abc_Clock() - clk );
}
Hsh_IntManStop( vHash );
Vec_IntFree( vData );
}
/*
Enumerating states of 2x2x2 cube.
Iter 0 -> 1 Time = 0.00 sec
Iter 1 -> 10 Time = 0.00 sec
Iter 2 -> 64 Time = 0.00 sec
Iter 3 -> 385 Time = 0.00 sec
Iter 4 -> 2232 Time = 0.00 sec
Iter 5 -> 12224 Time = 0.00 sec
Iter 6 -> 62360 Time = 0.02 sec
Iter 7 -> 289896 Time = 0.09 sec
Iter 8 -> 1159968 Time = 0.90 sec
Iter 9 -> 3047716 Time = 11.62 sec
Iter 10 -> 3671516 Time = 52.00 sec
Iter 11 -> 3674160 Time = 70.38 sec
Iter 12 -> 3674160 Time = 70.48 sec
*/
////////////////////////////////////////////////////////////////////////
/// END OF FILE ///
////////////////////////////////////////////////////////////////////////
ABC_NAMESPACE_IMPL_END
|
