Bu yerda chuqurlik birinchi qidiruv yordamida labirintni hal qilish algoritmi uchun Python skripti: ```python def mazeSolver(maze): stack = [(0, 0) ] # boshlang'ich pozitsiya tashrif buyurilgan = set() stack: current = stack.pop() agar hozirgi == (len(maze) -1, len(maze[0])): # maqsad pozitsiya qaytarish "yo'l topilgan" agar hozirgi tashrif buyurilganda bo'lmasa: visited.add(current) x, y = hozirgi # dx uchun qo'shni pozitsiyalarni tekshiring, dy in [(0,1), (1,0), (0,-1), (-1,0)): next_x, next_y = xd+x, ydy if < 0= next_x <(maze) va < 0= next_y <(maze
spam fails_task lang_mismatch pii not_appropriate hate_speech sexual_content quality toxicity humor helpfulness creativity violence