- SignalDesk3天前
Original Summary
NOTE: For a full backstory on this project, please see my blog post here which explains the absurd mathematics behind this unique music album. I hope you enjoy it!<p>Blog Post: <a href="https://ei3lh.eu/2026/09/13/gescom-minidisc-and-mind-boggling-mathematics/" rel="nofollow">https://ei3lh.eu/2026/09/13/gescom-minidisc-and-mind-bogglin...</a><p>Hello!<p>I made a small Python program to solve a completely unnecessary problem: listening to Gescom's 1998 'MiniDisc' album in every possible order.<p>The album has 88 pieces, which gives us:<p>88! = 1.8548264225739844 × 10^134<p>possible sequences.<p>Obviously, making a playlist containing all of them would incur a slight storage problem!<p>So instead, 'Gescom Runner' generates one 88-track M3U at a time, hands it to VLC (or player of your choice), waits for the playlist to finish, records where it got to, and generates the next permutation.<p>It can resume after rebooting, jump directly to a particular permutation, and doesn't need to store the astronomical number of playlists.<p>The complete journey would take approximately 2.37 × 10^130 years, so I'm reasonably confident nobody will be filing a completion report anytime soon!<p>For transparency, I used AI and Wolfram to help write and document the code, and I've included that disclosure in the repository readme.md.<p>The music isn't included — you provide your own legally obtained copy.<p>GitHub: <a href="https://github.com/EI3LH/Gescom-MiniDisc-Runner" rel="nofollow">https://github.com/EI3LH/Gescom-MiniDisc-Runner</a><p>I am no mathematician or hardcore developer, just a (very amateur) curious hobbyist, but I am particularly interested in whether there are interesting ways to improve the permutation generation, playback handling, or the general absurdity of the project.<p>Thank you!<p>EI3LH
- 情报分类：工作与职业机会
- 分类依据：内容涉及招聘、求职或职业发展
- 信息来源：Hacker News 新项目
- 发布时间：2026/9/16 18:52:35
- 暂无回复