// sprawdz czy w wylosowanych pozycjach jest już podana pozycja private bool DoPossitionsContainPossition(MemPossition pos, ref List <MemPossition> list) { foreach (var item in list) { if (item.memX == pos.memX && item.memY == pos.memY) { return(true); } } return(false); }
public Mem(MemPossition possition,int no) { InitializeComponent(); this.no = no; Grid.SetRow(this, possition.memY); Grid.SetColumn(this, possition.memX); Possition = possition; isActive = false; isVisible = false; if (GameHandler.GameType == GameType.number) { Numer.Text = no.ToString(); } }
// referencyjnie dodaj pojedynczą pozycję private void AddSinglePossition(ref Random rnd, ref List<MemPossition> list) { int x = rnd.Next(0, 8); int y = rnd.Next(0, 8); MemPossition possition = new MemPossition(x, y); if (!DoPossitionsContainPossition(possition, ref list)) { list.Add(possition); } else { AddSinglePossition(ref rnd, ref list); } }
// referencyjnie dodaj pojedynczą pozycję private void AddSinglePossition(ref Random rnd, ref List <MemPossition> list) { int x = rnd.Next(0, 8); int y = rnd.Next(0, 8); MemPossition possition = new MemPossition(x, y); if (!DoPossitionsContainPossition(possition, ref list)) { list.Add(possition); } else { AddSinglePossition(ref rnd, ref list); } }
public async static Task CheckOrder(MemPossition memPos) { if (memPos.memX == ActualLevel.Possitions[ActualMem].memX && memPos.memY == ActualLevel.Possitions[ActualMem].memY) { Points++; ActualMem++; } else { if (GameHandler.GameType == GameType.number) { App.GamePage.VM.timer.Stop(); } MessageBox.Show("Koniec Gry"); } if (ActualMem>=ActualLevel.Possitions.Count) { ActualMem = 0; if (GameHandler.GameType!=GameType.number) { await StartMemoryGame((ActualLevel.No + 1)); } else { App.GamePage.VM.timer.Stop(); } } }
// sprawdz czy w wylosowanych pozycjach jest już podana pozycja private bool DoPossitionsContainPossition(MemPossition pos, ref List<MemPossition> list) { foreach (var item in list) { if (item.memX == pos.memX && item.memY == pos.memY) { return true; } } return false; }