497 	Pieces=new Piece[PieceCount];  in Solver()
506 		Pieces[i].OrigDirs=0;  in Solver()
508 			if (p&A2PF[a]) Pieces[i].OrigDirs|=(1<<a);  in Solver()
509 			Pieces[i].Neighbor[a]=model->GetNeighborIndex(i,a);  in Solver()
517 	delete [] Pieces;  in ~Solver()
529 		Pieces[i].Dirs=Pieces[i].OrigDirs;  in IsUniqueSolution()
530 		Pieces[i].Placed=0;  in IsUniqueSolution()
531 		Pieces[i].Group=i;  in IsUniqueSolution()
532 		Pieces[i].NextPiece=-1;  in IsUniqueSolution()
533 		Pieces[i].FrontRing=-1;  in IsUniqueSolution()
538 			if (Pieces[i].Dirs&(1<<a)) Groups[i].OpenCount++;  in IsUniqueSolution()
568 		d=Pieces[Current].Dirs;  in IsUniqueSolution()
570 		Pieces[Current].Dirs=d;  in IsUniqueSolution()
571 	} while (d!=Pieces[Current].OrigDirs);  in IsUniqueSolution()
581 	d=Pieces[i].Dirs;  in CheckPiece()
583 		j=Pieces[i].Neighbor[a];  in CheckPiece()
587 		else if (Pieces[j].Placed) {  in CheckPiece()
588 			d2=Pieces[j].Dirs;  in CheckPiece()
608 	TBSet(Pieces[i].Placed,1);  in PlacePiece()
610 		j=Pieces[i].Neighbor[a];  in PlacePiece()
612 		if (Pieces[j].Placed) continue;  in PlacePiece()
613 		if (Pieces[j].FrontRing>=0) continue;  in PlacePiece()
615 			TBSet(Pieces[j].FrontRing,Pieces[FrontRing].FrontRing);  in PlacePiece()
616 			TBSet(Pieces[FrontRing].FrontRing,j);  in PlacePiece()
619 			TBSet(Pieces[j].FrontRing,j);  in PlacePiece()
631 		if ((Pieces[i].Dirs&(1<<a))==0) continue;  in UpdateGroups()
632 		j=Pieces[i].Neighbor[a];  in UpdateGroups()
633 		if (!Pieces[j].Placed) continue;  in UpdateGroups()
634 		g=Pieces[j].Group;  in UpdateGroups()
635 		g2=Pieces[i].Group;  in UpdateGroups()
644 			TBSet(Pieces[k].Group,g);  in UpdateGroups()
645 			t=Pieces[k].NextPiece;  in UpdateGroups()
649 		TBSet(Pieces[k].NextPiece,Groups[g].FirstPiece);  in UpdateGroups()
664 		j=Pieces[i].FrontRing;  in FindAndGetBestNext()
668 			d=Pieces[j].Dirs;  in FindAndGetBestNext()
670 			Pieces[j].Dirs=d;  in FindAndGetBestNext()
671 		} while (d!=Pieces[j].OrigDirs);  in FindAndGetBestNext()
681 	j=Pieces[i].FrontRing;  in FindAndGetBestNext()
687 		TBSet(Pieces[i].FrontRing,Pieces[j].FrontRing);  in FindAndGetBestNext()
689 	TBSet(Pieces[j].FrontRing,-1);  in FindAndGetBestNext()