Yay, finished my first lil' game with Löve !
It took me not much more than several hours, and much of the trouble came from the internal math. Everything else (shiny graphics, easy text rendering and stupendous drag and drop UI
) was so easy it was almost not fun to code anymore
Ah, where have gone the hours of SDL code debugging in C, with compilation times and invisible bugs ?..
So here it is, a little open source remake of Planarity (
http://www.planarity.net/). Not that I don't like the original, but I do happen to love open source. And it is clearly not. The guy even asks for donations for a game he probably didn't even spend a day making. Anyway...
The goal, if you don't know Planarity, is to drag the vertices (the little circles) in such a way that the edges (the lines) don't intersect. Simple. But difficult :twisted: A "planar" graph is a graph that can be drawn without intersections, in 2D. Hence the name.
You'll notice that the intersections and associated edges are drawn in red, and that when you'll have tided the mess, a "Next level" button appears. Difficulty increases with levels, of course (it's basically the number of vertices that increases).
I made sure it is always solvable (the graph is first drawn planar, then scrambled).
I hope you like it ! I'm open to any comments or suggestions, bug reports, etc.
Have fun !
PS : is it me or the circle primitive does a bad job under windows? I starting dev on Linux, and the circles were nice, but now that I test it on windows, I get not really round circles (see attachment). Any chance that it is due to my crappy PC, or is it the same everywhere ?