selfboot

5 ms·

1.
by selfboot 8mo ago
Hi HN, I’ve always loved Simon Tatham’s puzzle collection — especially Bridges, Slitherlink, and Signpost. I’ve been playing them for years on desktop and Android. Recently I decided to port the collection to iOS with a more modern native U
2.
by selfboot 9mo ago
My blog: https://selfboot.cn/en Side Project: https://puzzles-game.com/ and vibe coding app: https://apps.apple.com/us/app/simon-puzzles/id6756353841
3.
by selfboot 1y ago
To be honest, the function is a bit simple, and Claude code should be able to do better. I have also built games using Cursor, and I have to say that the current AI is really strong. https://puzzles-game.com/
4.
by selfboot 1y ago
very cool ~ I recently made a puzzle game, https://puzzles-game.com/ , which is also adapted to different screens and adds numeric keyboard support, which is somewhat similar to what you mentioned in your blog
5.
by selfboot 1y ago
A deep dive into the creation process and internal structure of SSTable files in LevelDB. This article takes a problem-driven approach to analyze how SSTable achieves high read/write performance through mechanisms like block storage, i
6.
by selfboot 1y ago
I have been trying for a long time but can't figure out how to play this game. Is there anyone who can give me some ideas? The rules of the game are simple: jump over a piece to remove the jumped piece. Try to remove all pieces except
7.
A modern puzzle games collection written with AI(puzzles-game.com)
2 points by selfboot 1y ago|1 comments
8.
by selfboot 1y ago
The original Simon Tathamʼs Portable Puzzle Collection has been a favourite of logic-puzzle lovers for decades, but it was written for the desktop environments of its time. This project brings those timeless games into the 21-st-century bro
9.
by selfboot 1y ago
This article delves into the implementation details of the high-performance LRU cache in LevelDB, covering its cache interface design, the LRUHandle data structure, doubly linked list optimizations, and sharding mechanism. By analyzing core
10.
by selfboot 1y ago
This article details the background and origins of MCP, its relationship with OpenAI Function Calling, and how to configure and use MCP Servers in Cursor. It explores practical scenarios like web automation, GitHub repository analysis, and
11.
by selfboot 2y ago
This article provides an in-depth analysis of LevelDB's write mechanism, detailing the complete process from the Put interface to WAL logging and MemTable persistence. Through source code analysis, it reveals how LevelDB achieves 400,0
12.
by selfboot 2y ago
If you’ve worked on any non-trivial C++ project, you’ve likely encountered process coredumps. A coredump is a mechanism where the operating system records the current memory state of a program when it encounters a severe error during execut
13.
by selfboot 2y ago
Zero front-end foundation, with cursor and claude 3.5 to implement a complete minesweeper game. This Minesweeper game offers two game modes: - *Classic Mode*: Traditional square grid minesweeper, identical to the one bundled with Windows. E
14.
by selfboot 2y ago
Over the weekend, I used Cursor and Claude3.5 to create a complete maze game based on an existing maze generation library. You can try it at [Maze Game, Online Maze Generation]( https://gallery.selfboot.cn/en/games/
15.
by selfboot 2y ago
I have been using cursor and Claude3.5 to write some fun projects. Recently, I suddenly had the idea to quickly write a online sokoban game. So I took some time off on the weekend and used Claude3.5 to help me realize a complete box-pushing
16.
by selfboot 2y ago
From time to time, I see some beautiful racing chart pages online, showing how data changes over time, which looks really cool. After researching, I found that there are ready-made JS libraries that can generate such charts, but I couldn&#x
17.
by selfboot 2y ago
This article provides a detailed analysis of the time complexity of skip lists. By breaking down the search problem, reversing the entire search process, and finding an appropriate L level, it ultimately derives the time complexity of skip
18.
by selfboot 2y ago
OpenAI released a new model, o1-preview, claiming stronger code generation and understanding capabilities, with various evaluations showing good results. I immediately tried the new model, including using the popular prompt for generating S
19.
by selfboot 2y ago
Skiplists are probabilistic data structures that can replace balanced trees, offering fast insertion, deletion, and search operations. LevelDB's skip list implementation is concise, stable in performance, and suitable for storing data
20.
by selfboot 2y ago
This article explores the implementation of core utility components in LevelDB, including the Arena memory allocator, Random number generator, CRC32 cyclic redundancy check, and integer encoding/decoding tools. It analyzes the design c
21.
Visualization of Consistent Hashing Rings(gallery.selfboot.cn)
15 points by selfboot 2y ago|3 comments
22.
by selfboot 2y ago
Claude3.5 helped me write a hashing visualization, which supports shadow nodes, adding nodes and keys, and can intuitively understand the hash ring method. By the way, there are many visualizations of common algorithms. Welcome to https:&#
23.
Made a cool site with AI as a newbie(gallery.selfboot.cn)
4 points by selfboot 2y ago|2 comments
24.
by selfboot 2y ago
I am a backend service developer with no front-end development experience. I have never used modern front-end technologies such as react, and I don’t even know much about CSS layout. With the help of claude3.5 and gpt4, I built a complete w