I will distribute "Displaying the Calculation Process of the Ackermann Function (Part 1) / Solving the DDR Footwork Optimization Problem" at Techbookfest 7
On September 22nd, at Techbookfest 7, I will distribute a book titled "Displaying the Calculation Process of the Ackermann Function (Part 1) / Solving the DDR Footwork Optimization Problem".
The physical book (with an electronic version) will be available for 1,000 yen, and an electronic version-only card will be available for 500 yen.
What kind of content?
The book is divided into two parts, with the first part written by me and the second part written by maton (@automatonix).
Part 1: "Displaying the Calculation Process of the Ackermann Function (Part 1)"
Using the Ackermann function as a theme, we will tackle large numbers and large data processing, and create a "Ackermann function calculation process printer" using Rust. Along the way, we will learn how to fight against recursive functions and memory overflow (using memoization, reducing stack usage, and clever data structures), and how to implement Test Driven Approach in Rust.
This time, the output will be around 1.5 GB, but in the next installment, we plan to tackle TB-class outputs using various techniques. We have included some ideas in the book, so those interested can try creating a printer that can handle TB-class outputs.
Part 2: "Solving the DDR Footwork Optimization Problem"
We will solve the problem of generating the minimum-cost footwork for a DDR (Dance Dance Revolution) song. Since a simple exhaustive search would take too long, we will use cost formulation and dynamic programming to make it possible to generate the footwork in a realistic time.
There are many factors involved in calculating the cost of footwork, and our current model does not consider some of these factors. In the next installment, we plan to formulate a more complex model that takes into account these factors and generates footwork automatically.
Exciting points
- Learn how to fight against large data
- Learn how to fight against recursive functions
- Practice Rust project development and Test Driven Approach
- Learn how to display the calculation process of the Ackermann function (up to several GB)
- Learn about large numbers
- Learn about the application of dynamic programming to real-world projects
- Learn how to generate DDR footwork automatically
- Learn about DDR
- The cover is cute, designed by Kōji Kobayashi
Images at the top
Author's Impression
Although it may seem like a niche genre, this book is actually a comprehensive introduction to software development. Starting from a naive implementation, we will tackle the challenges that arise and learn how to fight against recursive functions, memory overflow, and dynamic programming. The book also covers Rust project development, Test Driven Approach, and problem setting and formulation, which are essential for real-world software development. The topics of large numbers and DDR are also explained in an interesting way.
(Tokyo, Rectangular)
Please Check
If you're interested, please press the "Add to Circle Checklist" button. You might think, "I'll just buy it on the day," but each circle has no way to predict the number of copies to prepare, so we might end up with too few or too many copies, leading to disappointment.
...But this time, the number of copies is already fixed, so...
On the Day
I'll be waiting at 3F i35C. There might be a limited-edition bonus book available only at the venue!
The book will also be available at the reading area, so you can check the contents there.
I hope I can make it to the venue without oversleeping
