https://gcompris.net/index-en.html
https://news.ycombinator.com/item?id=18751739
https://hn.algolia.com/?query=gcompris&sort=byDate&type=comm...
- We have calls with grandparents regularly. My kids will say hi, but then they go play (usually on a screen so they are not too wild while we talk). Myself and my parents would love to have a game (and be willing to pay) where the grandparents and kids can play together on, say a TV, while having the phone/tablet run the video call.
- We had this problem with "low quality" games until we got a Nintendo Switch. Games aren't free/cheap like on phones, and so we have fewer. The kids focus more on a limited set of games and they're not full of ads.
Like Number Munchers is a fine game. It's not a revolution in education or anything. But it would not be very hard to clone, publish, and make it easier to find and use than an archive.org emulator. Make it data driven and educators might want to contribute new tasks.
One game isn't much but if you put half a dozen together that could be a good start. In my experience kids are not as picky as people expect so long as you treat them decently.
It is free and online. No user registrations. No trackers. No 3rd party scripts or dependencies and the entire web app is self-contained. Just HTML/CSS/JS + media assets.
It is based on interactive 3-SAT solving although I deliberately made a point of not mentioning it on the game's home page to keep it appealing to the widest possible audience, not just CompSci/SAT folks.
Would love to hear what you and your 4/yo think of it.
Of course, open to collabs.
> The selected pieces must not contain both a and of the same color.
The following example shows a couple X's selected with the same color in different rows. Are you trying to say O's and X's cannot share a color?
If you think of this in terms of 3-SAT, the O's are positive literals (like a, b, c etc.,) and X's are negative literals (like a', b', c' etc.,) and the color is used to denote the underlying variable (ie., a, b etc.,). Each row is a disjunctive clause (eg: a + b' + c, where + denotes Logical OR or disjunction). Consecutive rows represent a conjunction (eg: (a + b' + c).(a + b + c').
The condition ensures that we don't permit a selection such as b.b' or c.c' since they would evaluate to False in Boolean algebra. The goal is to get a selection that doesn't contain a literal and its complement.
Due to the distributive law in Boolean algebra, solving SAT is equivalent to finding a term that doesn't vanish to False when the formula is fully expanded out.
Thanks for trying it out.