This is a game, which measures the complexity of directed graphs by means of Boolean algebra.
(Boolean Complexity)
1.Graph drawing begins from the top node P0.Each participant draws a blue edge downward in order to create a directed graph.
(Each edge is drawn by means of finger slide. The starting and the ending nodes are decided by using a pointer. They are fixed by FIX button.)
2.After drawing each edge, NBE algorithm works automatically to grow a red beard.
3.As soon as a red beard grows, the numbers of both blue atoms j and red atoms k are calculated. Afterwards, the graph is automatically embedded to the target Boolean algebra B(j+k).
4.When j+k≦6, the edge drawing passes the game criteria.
So, the picture returns to the original graph G to continue the game.
5.When j+k>6, the edge drawing fails the game criteria.
6.The interesting is to create the resulting graph as many edges as possible, when the game is over.
熱門國家 | 系統支援 | 版本 | 費用 | APP評分 | 上架日期 | 更新日期 |
---|---|---|---|---|---|---|
未知 | Android Google Play | 1.0.0 App下載 | JPY$500.0 | 1970-01-01 | 2015-01-15 |