Algorithm Game Introduction

The primary goal of this site is efficiency, aiming for readers to quickly master algorithms and succeed in interviews and written tests.

On this basis, I also hope to make the learning process as interesting as possible. Simply practicing problems for interview preparation can be somewhat dull.

If readers can intuitively feel the charm of algorithms and genuinely view learning algorithms as an exploratory process, it can generate intrinsic motivation, not only improving learning efficiency but also adding a bit of fun.

Finding a job these days can be quite exhausting, and algorithm challenges have become almost a requirement for all technical positions, so why not make it more enjoyable?

After research, I believe combining algorithm learning with gaming is a great approach. Not only is it interesting, but it also allows readers to understand the application of algorithms in real-world scenarios, achieving two goals with one effort.

Gamification vs. Visualization

With the Visualization Dashboard, why still need algorithm games?

I have thought about this question and believe it's necessary because they solve different problems.

The algorithm visualization dashboard answers questions like: What is the execution process of this code? Why should this variable n be incremented by +1 instead of +2?

Algorithm games answer questions like: In which real-world scenarios can this algorithm be considered? How to use it?

Therefore, in the game scenarios I design, it's not simply about visualizing algorithms, but combining them with game scenarios, requiring players to flexibly combine data structures and algorithms to complete tasks, highlighting the role of algorithms in the game.

Below is a brief introduction on how to use the game's dashboard on this site.

How to Use the Game Dashboard

In the top-right corner of the dashboard, there is a full-screen button. Enabling full-screen display makes coding more convenient.

The left side of the panel is the game interface, the upper right is the problem description, and the lower right is the code editor. You need to write code in the editor to meet the problem requirements, then click the "Submit" button to run the code with the game engine. You can interact with the game to check if it meets expectations.

Below is a "Snake" game panel. After clicking the "Begin" button to start the game, the snake will not move because this problem examines the practical application of doubly linked lists, requiring you to complete the snake's movement logic.

You need to write the correct algorithm in the code editor to move the snake, click the "Submit" button to submit the code to the game engine, and finally click the "Begin" button; the game will run normally, thus creating a playable mini-game:

Reference Solution:

var move = function(snake, direction, foodPosition) {
    const currentHead = snake.getFirst()
    // Calculate new head position
    const newHeadPos = new Point(currentHead.x, currentHead.y)
    switch (direction) {
        case 'right': 
            newHeadPos.x += 1
            break
        case 'left': 
            newHeadPos.x -= 1
            break
        case 'up': 
            newHeadPos.y += 1
            break
        case 'down': 
            newHeadPos.y -= 1
            break
        default:
            throw new Error('Invalid direction')
    }

    // Add new head node
    snake.addFirst(newHeadPos)

    if (!newHeadPos.equals(foodPosition)) {
        // Remove tail node if not eating food
        snake.removeLast()
    }
}

Game Compilation

The game sections are scattered throughout the site's directory (marked with ). Here is a compilation for readers interested in exploring further.

The game feature is still in beta testing. I have many interesting ideas, but only a portion is currently online. More exciting games will be available soon.

Snake Game

Examines the practical application of doubly linked lists. See details in Implementing Snake Game:

Minesweeper Game

Minesweeper examines various algorithms.

Firstly, it tests random algorithms. You need to master the shuffle algorithm and reservoir sampling algorithm. See details in Implementing Minesweeper Game:

We generally use the Monte Carlo method to verify the uniformity of random algorithms. The site also provides a Monte Carlo validator, where you can input the random algorithm for generating the Minesweeper map for verification:

Sudoku Game

Solve Sudoku puzzles of any difficulty using the backtracking algorithm. See details in Implementing Sudoku Game: