A more interesting possibility is the post-Tramiel Commodore including a ROM version of GEOS from 1986 onward, and selling it on cartridge form to existing customers.
Other possibilities:
* Launch Amiga 2000 and 500 in 1985 instead of 1000.
* Eschew Amiga completely, in favor of the Commodore 900 with Coherent. Instead of Amiga silicon, ship with a "VIC-III" for graphics and two SIDs for stereo 6-channel sound.
I have a copy of "Tiny" Pascal by Supersoft from 1979 on a cassette tape which was licensed to Tandy Corp and which would load onto a 16KB TRS-80 Model III and allow a bit of room for programming.
One of the great regrets of my life is that when I was doing so and when it would have mattered, I was unaware of the patch for this which would have allowed it to be saved as an executable to a TRS-DOS disk....
Before then, however, BASIC was already popular on minicomputers as both an introductory language for beginners and a business language; the various "Business BASIC" dialects providing a small-business alternative to COBOL on mainframes with their features for decimal math and ISAM database access.
Those ideas will almost always be ignored if the author neglects their due diligence to test the idea and document real-world results. Influencers like Jeff Geerling and Tom Scott would be (rightfully!) hated if they published their video ideas in the form of an AI-generated outline.
But denigrating AI on social media is helpful if you think it can delay your unemployment as a result of AI.
On each move, you rotate a row or column by one step (with wraparound).
The twist is what happens at the edges:
* If a tile wraps around and matches the edge color → it disappears
* If it doesn’t match → it wraps normally
* If an empty space wraps → it becomes a new tile with the color of the edge it enters
You’re trying to remove tiles, but sometimes you have to create new ones to make progress.
Goal: end with as many empty spaces in the grid as you can within the move limit.
Check it out:
https://testflight.apple.com/join/3sstMjRK [iPhone/iPad]
Any feedback would be appreciated. Have fun!
The idea is simple:
* You use color matching in two distinct ways: matching circles create snakes, and matching a snake’s color with the squares beneath it destroys them.
* Only snakes can move, and you move them in a worm-like fashion across the grid to new positions.
* Your goal is to destroy as many squares as you can. Note that destroying all of them may not be possible.
App Store link: https://apps.apple.com/us/app/plurisnake/id6756577045 [macOS/iOS/iPadOS]
Features:
* A new daily puzzle that is the same for everyone
* iCloud sync across devices
I'd love to hear what people think and how far you can get on today’s puzzle.
--
P.S. Here are the game rules:
Goal
* Destroy colored squares on a 7×7 grid using snakes made of same-colored circles. Your score is based on how many squares you destroy.
* Clearing all 49 squares is not required, and may not always be possible.
Board Setup
* Each cell contains one square and one circle, both randomly colored.
* There are 7 colors total, with each color appearing 7 times among squares and 7 times among circles.
Energy
* Energy is a shared pool for all snakes and is initially 0 units.
* Moving a snake costs 1 energy unit, regardless of how far you move it.
* You can form a snake to gain energy and spend it to move any snake on the board.
Forming Snakes
* Link 2 or more adjacent circles of the same color (orthogonal or diagonal) to form a snake.
* A snake with n circles has n – 1 links. Forming a snake immediately adds n – 1 energy units to your energy pool.
* Squares under a newly formed snake of the same color are destroyed immediately.
Moving Snakes
* Snakes move in a worm-like fashion (both orthogonal and diagonal steps are allowed), following a continuous path of isolated circles.
* Snakes cannot move onto cells occupied by other snakes. Moving a snake can pass over isolated circles (circles not part of a snake). When this happens, each circle you pass over is teleported to the cell the snake just vacated.
Square Destruction
* When a snake finishes its move, it destroys any squares of its color under its final positions.
* Moving a snake past a matching square without stopping over it does not destroy the square.
Ending the Game
* The game ends automatically if all 49 squares are destroyed, or you can end it manually at any time by triple-tapping anywhere.
* Your score counts toward the global leaderboard regardless of whether you clear all squares.
I strongly doubt it. My AIs can generate infinite HN comments for me. I don’t do that because it isn’t interesting. But if the day arises where it is, I want that personalized content. Not something someone else copy pasted.
(I say this as someone who finds Moltbook fascinating and push myself to use AI more in my work and day-to-day life. The fact that it’s borderline trivial to figure out which HN comments are AI generated speaks to the motivation behind this guideline.)
And despite what people say, the way you write is very much judged as an indication of your education and intelligence.
People who don't like the use of AI to help you write really don't want those signals to go away.
They want to be able to continue to judge others based on their English grammar instead of on the content of their writing.
Good argument for it but I think 80/20 split applies here. It is likely that 80% of the time it is used to farm for upvotes and add noise.
> And despite what people say, the way you write is very much judged as an indication of your education and intelligence.
I have come across plenty of content and online interactions in English where English was the Author's 2nd or even 3rd language and I find that putting a small disclaimer about this fact is more than enough to bypass such judgement.
Edit for amichail, since I'm rate-limited at the moment: I don't want flawless English writing. I want real ideas from real people. If I wanted flawless English writing, I'd be reading The New Yorker, not HN.
Pretty soon we're gonna see arguments that its discriminatory.
"Integer multiplication in time n(log n)" https://annals.math.princeton.edu/2021/193-2/p04