I've just finished implementing my Solitaire game with curses interface in C. Solitaire was the first computer game I have played and I never got around to implementing it.

This is a writeup of how the game was made, using the vim+gcc+gdb stack.

Although working on a completely different tech stack at work, I like C, there's something zen-like about being close to the machine and almost universally portable.

I probably would have opted for the array representation instead of linked lists, but that is somewhat subjective thing. I do note that each card can be represented by single byte fairly easily (2 bits for suit, 4 bits for rank, 1 bit for revealed (maybe)), which would reduce memory consumption if that is concern. Thinking more of it, I think the whole board-state could be represented with 13+52 byte array, having markers between the cards to indicate different piles. Not that I'd recommend that approach unless you are extremely memory constrained, it probably would bit annoying to handle

fyi I noticed that your mallocz seems to reimplement calloc: https://pubs.opengroup.org/onlinepubs/009695399/functions/ca...

Neat. I've made an implementation of Solitaire in JS (React/HTML/GSAP) - https://online-solitaire.com/ - but really interesting how it can be done in a low-level language like C.

Good game and good implementation;

Mac need to use ncurses and no tinfo and not sure the implication.

And do not type c8, segment fault. Thought it use linked list not array ...

Very good game and play a few round