“Frustration”, a sketch of a 2-player tile placement game.
Suppose there is a board, divided up into polygonal tiles of some sort. Around the edges of the board are black and white tiles, fixed in place. The board can be a regular triangular or square tiling, an irregular tiling, a Voronoi thing, whatever. Here’s a triangular board:

The players decide which of the two will be the Same Player, and which will be the Different Player. Players take turns coloring one of the uncolored (gray) tiles either black or white. Each player can color any gray tile with either color. A player has to color a tile on his turn. When all open tiles are full, the Same Player gets one point for every edge between tiles (including the permanent border) where two white tiles or two black tiles meet, and the Different Player gets one point for every edge where different colors meet.
Refinement: In addition to points for edge similarity or difference, the Same Player gets one additional point for every tile where a clear majority of edges are the same, and the Different Player gets one additional point for every tile where a clear majority of edges are different. So for example, if the tiles are all square, the only extra points for the Same Player are squares with three or four neighbors of the same color, and for the Different Player only three or four tiles of a different color.
Is this a thing already? Is it trivial? Easily solvable? Interesting? Fun?
Later: Here’s a random board, just to poke around with:

Pingback: Sketch of an “artificial scientist” project | Pragmatic Genetic Programming