public bool TryGetPermutation(byte *output, out uint permutationHash) { for (; currentRow < 4; currentRow++) { for (; currentColumn < 4; currentColumn++) { if (grid[currentRow * 4 + currentColumn] == 0) { GridFunctions.CloneGrid(collapsedGrid, output); GridFunctions.CloneRow(grid + rowDelta * currentRow + offset, output + rowDelta * currentRow + offset, columnDelta); output[currentRow * 4 + currentColumn] = 1; GridFunctions.collapseRow(output + rowDelta * currentRow + offset, columnDelta); uint rowHash = GridFunctions.GetRowHash(output + rowDelta * currentRow + offset, columnDelta); rowHash <<= 2; rowHash |= (uint)currentRow; permutationHash = rowHash; currentColumn++; return(true); } } currentColumn = 0; } permutationHash = 0; return(false); }
public unsafe Direction Solve(byte *grid) { byte *[] grids = new byte *[4]; for (int i = 0; i < 4; i++) { grids[i] = GridFunctions.CloneGrid(grid); } Dictionary <Direction, int> scores = new Dictionary <Direction, int>(); int j = 0; foreach (Direction direction in Enum.GetValues(typeof(Direction))) { if (GridFunctions.GridCanCollapse(grid, direction) == false) { scores[direction] = -1; continue; } GridFunctions.CollapseGridInPlace(grids[j], direction); scores[direction] = GridFunctions.CountEmptySquares(grids[j]); } return(scores.OrderByDescending(x => x.Value).First().Key); }
public unsafe Direction Solve(byte *grid) { GridStack stack = new GridStack(128); GridFunctions.CloneGrid(grid, stack.current); Dictionary <Direction, int> scores = new Dictionary <Direction, int>(); foreach (Direction direction in Enum.GetValues(typeof(Direction))) { //Console.WriteLine(direction); if (GridFunctions.GridCanCollapse(grid, direction) == false) { //Console.WriteLine("\tCant Collapse"); continue; } stack.pushCurrent(); GridFunctions.CollapseGridInPlace(stack.current, direction); scores[direction] = ScoreForGrid(stack, 1); stack.pop(); //Console.WriteLine("\tScore: " + scores[direction]); } return(scores.OrderByDescending(x => x.Value).First().Key); }
public unsafe Direction Solve(byte *grid) { this.current = data; int[] scores = new int[4]; byte *tempGrid = GridFunctions.CreateGrid(); for (int direction = 0; direction < 4; direction++) { //Console.WriteLine(direction); if (GridFunctions.GridCanCollapse(grid, (Direction)direction) == false) { //Console.WriteLine("\tCant Collapse"); //GridFunctions.printGrid(grid); scores[(int)direction] = 0; continue; } GridFunctions.CloneGrid(grid, tempGrid); GridFunctions.CollapseGridInPlace(tempGrid, (Direction)direction); int permutations = GridFunctions.CountEmptySquares(grid); const int depth = 2; if (permutations > 5) { scores[direction] = ScoreForGrid(tempGrid, depth); } else if (permutations < 3) { scores[direction] = ScoreForGrid(tempGrid, depth + 2); } else { scores[direction] = ScoreForGrid(tempGrid, depth + 1); } //Console.WriteLine("\tScore: " + scores[direction]); } GridFunctions.FreeGrid(tempGrid); int max = 0; Direction maxDir = Direction.left; for (int i = 0; i < 4; i++) { if (scores[i] > max) { max = scores[i]; maxDir = (Direction)i; } } return(maxDir); //return scores.OrderByDescending(x => x.Value).First().Key; }
public Permutator(byte *grid, Direction direction) { this.grid = GridFunctions.CreateGrid(); GridFunctions.CloneGrid(grid, this.grid); this.direction = direction; collapsedGrid = GridFunctions.CreateGrid(); GridFunctions.CloneGrid(grid, this.collapsedGrid); GridFunctions.CollapseGridInPlace(collapsedGrid, direction); currentRow = 0; currentColumn = 0; GridFunctions.GetDeltas(direction, out offset, out rowDelta, out columnDelta); }