欢迎来到 App Annie!
在这里您可以找到关于4 Сolors以及数百万其他应用的所有信息。免费注册并了解更多您喜欢的应用、竞争对手的洞见以及应用行业中正在发生的一切。

4 Сolors

评价:
价格: 0.99 USD

应用排名历史

查看 中国 中4 Сolors 的下载量历史排名。
排名历史显示4 Сolors在Windows Phone应用商店中的流行度以及其随着时间的变化。您可以追踪4 Сolors在不同国家、分类和设备上每一天的表现。
下载排名 - Windows Phone - 中国
上周本周
没有上周排名数据
本周数据可在注册后免费使用。
查看本周截至一小时前的数据。

免费注册来发掘更多!

免费注册来获取排名、评价、评级、关键词和更多数据的无限访问权限。

应用说明

Game "four colors" was invented based on the famous theorem of the four colors. It argues that any geographical map can be colored so that any countries that have a common border, can be painted in different colors. And that's enough for four colors. For a long time it could not prove it was done only in the 70s. XX century by a computer.

The playing field has a size of 4x4 cells. Side of the playing field painted in blue, green, red and yellow. The first course is painted cell adjacent to the side, each subsequent course can paint the cell, which is adjacent to one of the shaded cells. It is impossible to paint the color of the cell so that colored in one of the adjacent cells (including diagonal) or adjacent to the cell surface. The winner is the player who makes the last move.

For convenience, all the moves that a player can make are highlighted with small chips. To select a color chips that you want to go, click on the corresponding chip at the bottom of the board.

History
In mathematics, the four color theorem, or the four color map theorem, states that, given any separation of a plane into contiguous regions, producing a figure called a map, no more than four colors are required to color the regions of the map so that no two adjacent regions have the same color. Two regions are called adjacent if they share a common boundary that is not a corner, where corners are the points shared by three or more regions. For example, in the map of the United States of America, Utah and Arizona are adjacent, but Utah and New Mexico, which only share a point that also belongs to Arizona and Colorado, are not.

Despite the motivation from coloring political maps of countries, the theorem is not of particular interest to mapmakers. According to an article by the math historian Kenneth May (Wilson 2002, 2), “Maps utilizing only four colors are rare, and those that do usually require only three. Books on cartography and the history of mapmaking do not mention the four-color property.”

Three colors are adequate for simpler maps, but an additional fourth color is required for some maps, such as a map in which one region is surrounded by an odd number of other regions that touch each other in a cycle. The five color theorem, which has a short elementary proof, states that five colors suffice to color a map and was proven in the late 19th century (Heawood 1890); however, proving that four colors suffice turned out to be significantly harder. A number of false proofs and false counterexamples have appeared since the first statement of the four color theorem in 1852.

The four color theorem was proven in 1976 by Kenneth Appel and Wolfgang Haken. It was the first major theorem to be proved using a computer. Appel and Haken's approach started by showing that there is a particular set of 1,936 maps, each of which cannot be part of a smallest-sized counterexample to the four color theorem. (If they did appear, you could make a smaller counter-example.) Appel and Haken used a special-purpose computer program to confirm that each of these maps had this property. Additionally, any map that could potentially be a counterexample must have a portion that looks like one of these 1,936 maps. Showing this required hundreds of pages of hand analysis. Appel and Haken concluded that no smallest counterexamples exists because any must contain, yet do not contain, one of these 1,936 maps. This contradiction means there are no counterexamples at all and that the theorem is therefore true. Initially, their proof was not accepted by all mathematicians because the computer-assisted proof was infeasible for a human to check by hand (Swart 1980). Since then the proof has gained wider acceptance, although doubts remain (Wilson 2002, 216–222).

To dispel remaining doubt about the Appel–Haken proof, a simpler proof using the same ideas and still relying on computers was published in 1997 by Robertson, Sanders, Seymour, and Thomas. Additionally in 2005, the theorem was proven by Georges Gonthier with general purpose theorem proving software.

与 App Annie 一起了解上百万个应用的所有信息,掌握应用行业中正在发生的一切。