MineSweep vs ArrayQuest

【Minesweeper】 game, divided into 3 levels according to difficulty, the difficulty level is at your disposal. The goal of minesweeper games is to find all the mines in the minefield as soon as possible, without stepping on them, if it is a mine, you will lose the game. Game Features: 1. Three different difficulty levels and custom difficulty levels 2. Double-click the quick tag 3. Compare difficulty with world players, world leaderboard 4. Fallback error 5. Game theme change Rules of the game: 1. Single-machine blocks can dig blocks. If the number is displayed, congratulations, there is no mine, the number represents the number of mines present in the eight directions around it, and on this basis, it is inferred which block to dig next; 2 After double-clicking the square, you can mark the other block with a mine, if you want to cancel, double-click again to cancel; Minesweeper is a game to exercise your reasoning skills, come and set your world record!

Real computer science problems. Turned into a game. ArrayQuest transforms two classic algorithms — Maximum Submatrix and Maximum Path Sum — into addictive puzzles you can play anywhere. Use logic, intuition, and strategy to find the optimal solution hidden inside every grid. ---- Two Game Modes ---- ▶ Max Submatrix Drag across the grid to select a rectangle with the highest total sum. Pack in as many positive numbers (blue) as you can, and cut out the negatives (red). Grids grow larger as you advance — your thinking has to grow with them. ▶ Max Path Sum Slide your finger from the top-left cell to the bottom-right, tracing the path with the maximum sum. You can only move right or down — deceptively simple, strategically deep. Reach the goal and the game judges instantly. ---- Features ---- • Stage System: grids get bigger, challenges get sharper • Scoreboard: Record your clear times and chase your personal best • Rules Guide: Clear explanations for each mode, with worked examples • Swipe Input: Smooth, intuitive gesture controls throughout Can you find the optimal solution?