GameMind original
Home & Garden Connections
Sort sixteen familiar household words into four tidy groups.
ConnectionsTop 20 for this game
Where will you land?
Accuracy comes first. When scores are tied, the faster finish takes the higher position. Only each player’s best result is kept for the selected period.
Live community
Home & Garden Connections leaderboard
- 4 Open spotComplete a game to claim it —Awaiting player
- 5 Open spotComplete a game to claim it —Awaiting player
- 6 Open spotComplete a game to claim it —Awaiting player
- 7 Open spotComplete a game to claim it —Awaiting player
- 8 Open spotComplete a game to claim it —Awaiting player
- 9 Open spotComplete a game to claim it —Awaiting player
- 10 Open spotComplete a game to claim it —Awaiting player
- 11 Open spotComplete a game to claim it —Awaiting player
- 12 Open spotComplete a game to claim it —Awaiting player
- 13 Open spotComplete a game to claim it —Awaiting player
- 14 Open spotComplete a game to claim it —Awaiting player
- 15 Open spotComplete a game to claim it —Awaiting player
- 16 Open spotComplete a game to claim it —Awaiting player
- 17 Open spotComplete a game to claim it —Awaiting player
- 18 Open spotComplete a game to claim it —Awaiting player
- 19 Open spotComplete a game to claim it —Awaiting player
- 20 Open spotComplete a game to claim it —Awaiting player
About this game
A weekend’s worth of household objects has landed on the same board.
What you will find
Find the four groups associated with gardening, sewing, baking and home repair.
Play your way
There is no forced timer and no account is required. Read each prompt at your own pace, use the available hint when you want one, and share your result when you finish.
GameMind games are created for entertainment. They are not medical or cognitive assessments.
Keep playing
You may also enjoy…
Connections
✓ Played
Binary Logic
✓ Played
Sun & Moon Logic
Balance suns and moons so no row or column repeats or contains three alike in…
Constraint Logic
✓ Played
Logic Ledger
Balance a network of true and false signals until every written constraint agrees.