+++Benevolently Beloved'+++ +++Democratic Party Idealog'+++ +++Loki Epona Phoenix' Phases+++

Friday, December 15, 2006


© 2006 Mark Robert Gates
Plenarial Disease: Giving false instructions in a planned demonstration of supposed mental superiority.

Sociallairistic intercourse treatment: Arrange a side-by-side demonstration, in a public area, of the plenarian’s diseased, result, and your own vastly superior, reality based results.

This article is being considered for deletion in accordance with Wikipedia's deletion policy.
Please share your thoughts on the matter at this article's entry on the Articles for deletion page.
Feel free to edit the article, but the article must not be blanked, and this notice must not be removed, until the discussion is closed. For more information, particularly on merging or moving the article during the discussion, read the guide to deletion.

Steps to list an article for deletion: {{subst:afd}} • Preloaded debate OR {{subst:afd2pg=Planaritycat=text=}} • {{subst:afd3pg=Planarity}} log

This article is about the game; for the graph theory property, see Planar graph.

Planarity is the name of a puzzle computer game based on a concept by Mary Radcliffe at Western Michigan University.[1]

The name comes from the term planar graph. In graph theory, a planar graph is a graph that can be embedded in a plane so that no edges intersect. In the game, the player starts out with a tangled series of connected dots, and has to untangle the web until no edges intersect.

The original implementation of this game was a flash game developed by John Tantalo at Case Western Reserve University.[1] It in turn has inspired the creation of a [[GTK+]] version by Xiph.org's Chris Montgomery, which possesses additional level generation algorithms and the ability to manipulate multiple nodes at once.[2]

^ a b Planarity FAQ.
^ gPlanarity home.

External links
Planarity.net — the original flash game
gPlanarity — an improved [[GTK+]] version

No comments: