using CDSAE3_Lian_Lian_Kan.Forms.Interface; namespace CDSAE3_Lian_Lian_Kan.Boards { public partial class Board:IBoard { private int[,] Bd = { { } };//y,x private Dictionary> board_Index = new Dictionary>(); private int[] Vals_per_Image { get; set; } = Array.Empty(); private int total; private int Total { get { return total; } set { total = value; if (Total == 0) Etcs.gameModeForm?.Finished_Handler(this, new FinishArgs { finish_Type = FinishArgs.Finish_Type.All_done }); } } private Board_funcs board_Funcs = new Board_funcs(); public int[,] make_board()//Size from Etcs.get_length_width() { size = Etcs.get_length_width(); var (width, height) = size; Bd = new int[height + 2, width + 2]; for (int i = 0; i < height + 2; i++) for (int j = 0; j < width + 2; j++) Bd[i, j] = -1; int sum = width * height; if (sum % 2 != 0) sum--; total = sum; int types = Etcs.Images_size(); Vals_per_Image = board_Funcs.get_vals_per_image(Total, types); int last_val = -1; int cur_width = 1, cur_height = 1; var temp_val_per_Image = (int[])Vals_per_Image.Clone(); for (int i = 0; i < sum; i++) { Bd[cur_height, cur_width] = board_Funcs.getval(ref temp_val_per_Image, ref last_val, types); if (board_Index.TryGetValue(Bd[cur_height, cur_width], out var index)) index.Add((cur_width, cur_height)); else board_Index.Add(Bd[cur_height, cur_width], new List<(int, int)> { (cur_width, cur_height) }); cur_width++; if (cur_width > width) { cur_height++; cur_width = 1; } } return Bd; } public int[,] remake_board() { board_Index.Clear(); var rand = new Random(); int[] temp_val_per_Image = (int[])Vals_per_Image.Clone(); int types = Vals_per_Image.Length; int height = Bd.GetLength(0); int width = Bd.GetLength(1); int last_val = -1; for (int i = 0; i < height; i++) for (int j = 0; j < width; j++) if (Bd[i, j] != -1) { Bd[i, j] = board_Funcs.getval(ref temp_val_per_Image, ref last_val, types); if (board_Index.TryGetValue(Bd[i, j], out var index)) index.Add((j, i)); else board_Index.Add(Bd[i, j], new List<(int, int)> { (j, i) }); } return Bd; } public (bool, List<(int, int)>?) test((int, int) a, (int, int) b)//x,y { bool reverse = false; if (a == b) return (false, null); if (Bd[a.Item2, a.Item1] != Bd[b.Item2, b.Item1]) return (false, null); var (xa, ya) = a; var (xb, yb) = b; Func line_test = (bool x, int ct, int from, int to) => {//ct is x (x==true)left to right ///up to down if (from > to) (from, to) = (to, from); if (x) { for (int i = from + 1; i < to; i++) if (Bd[ct, i] != -1) return false; } else for (int i = from + 1; i < to; i++) if (Bd[i, ct] != -1) return false; return true; }; if (xa == xb) if (line_test(false, xa, ya, yb)) return (true, new List<(int, int)> { a, b }); if (ya == yb) if (line_test(true, ya, xa, xb)) return (true, new List<(int, int)> { a, b }); (int, int)[] squareA = new (int, int)[4]; (int, int)[] squareB = new (int, int)[4];//urdl {//two line test HashSet<(int, int)> reachableA = new HashSet<(int, int)>(), reachableB = new HashSet<(int, int)>(); Func<(int, int), HashSet<(int, int)>, bool> check_insert = ((int, int) pos, HashSet<(int, int)> insert) =>//x,y { if (pos.Item1 < 0 || pos.Item2 < 0 || pos.Item1 >= Bd.GetLength(1) || pos.Item2 >= Bd.GetLength(0)) return false; if (Bd[pos.Item2, pos.Item1] == -1) { insert.Add(pos); return true; } return false; }; Func<(int, int), HashSet<(int, int)>, HashSet<(int, int)>, (int, int)[], (bool, int, int)> cross_test = ((int, int) pos, HashSet<(int, int)> insert, HashSet<(int, int)> test, (int, int)[] square) =>//x,y { var (x, y) = pos; for (x--; ; x--) if (check_insert((x, y), insert)) { if (test.Contains((x, y))) return (true, x, y); } else { square[3] = (x + 1, y); break; } (x, y) = pos; for (x++; ; x++) if (check_insert((x, y), insert)) { if (test.Contains((x, y))) return (true, x, y); } else { square[1] = (x - 1, y); break; } (x, y) = pos; for (y--; ; y--) if (check_insert((x, y), insert)) { if (test.Contains((x, y))) return (true, x, y); } else { square[0] = (x, y + 1); break; } (x, y) = pos; for (y++; ; y++) if (check_insert((x, y), insert)) { if (test.Contains((x, y))) return (true, x, y); } else { square[2] = (x, y - 1); break; } return (false, -1, -1); }; cross_test(a, reachableA, reachableB, squareA); var (find_ans, pax, pay) = cross_test(b, reachableB, reachableA, squareB); if (find_ans) return (true, new List<(int, int)> { a, (pax, pay), b }); if (reachableA.Count > reachableB.Count) { (a, b) = (b, a); reverse = true; } } {//three line test Func<(int, int), (int, int), (bool, (int, int))> intersection = ((int, int) a, (int, int) b) =>//first small last big { if (a.Item1 > b.Item1) (a, b) = (b, a); if (a.Item2 < b.Item1) return (false, (-1, -1)); if (a.Item2 > b.Item2) return (true, (b.Item1, b.Item2)); return (true, (b.Item1, a.Item2)); }; var (throughx, xrange) = intersection((squareA[3].Item1, squareA[1].Item1), (squareB[3].Item1, squareB[1].Item1)); var (throughy, yrange) = intersection((squareA[0].Item2, squareA[2].Item2), (squareB[0].Item2, squareB[2].Item2)); Func<(int, int), int, List> swing_check = ((int, int) range, int center) => { List result = new List(); if (center < range.Item1) { for (int k = range.Item1; k <= range.Item2; k++) result.Add(k); return result; } if (center > range.Item2) { for (int k = range.Item2; k >= range.Item1; k--) result.Add(k); return result; } result.Add(center); Func inrange = (int t) => t >= range.Item1 && t <= range.Item2; bool go_on = true; for (int i = 1; go_on; i++) { go_on = false; if (go_on |= inrange(center + i)) result.Add(center + i); if (go_on |= inrange(center - i)) result.Add(center - i); } return result; }; if (throughx) foreach (int i in swing_check(xrange, a.Item1)) if (line_test(false, i, a.Item2, b.Item2)) if (reverse) return (true, new List<(int, int)> { b, (i, b.Item2), (i, a.Item2), a }); else return (true, new List<(int, int)> { a, (i, a.Item2), (i, b.Item2), b }); if (throughy) foreach (int i in swing_check(yrange, a.Item2)) if (line_test(true, i, a.Item1, b.Item1)) if (reverse) return (true, new List<(int, int)> { b, (b.Item1, i), (a.Item1, i), a }); else return (true, new List<(int, int)> { a, (a.Item1, i), (b.Item1, i), b }); } return (false, null); } public void decrease(params (int, int)[] poss) { foreach (var (x, y) in poss) { int type = Bd[y, x]; Bd[y, x] = -1; if (!board_Index[type].Remove((x, y))) throw new Exception("Val not Found in board_Index"); Vals_per_Image[type]--; Total--; } } public List> get_tip((int, int) start) { List> ans = new List>(); if (board_Index.TryGetValue(Bd[start.Item2, start.Item1], out var tip)) foreach (var pos in tip) { var (result, path) = test(start, pos); if (result && path != null) ans.Add(path); } return ans; } public (int, int) size { get; set; }//width,height } }