| Flow Free | |
|---|---|
 | |
| Developer(s) |
|
| Publisher(s) | Big Duck Games LLC |
| Series | Flow Free |
| Platform(s) | |
| Release | June 7, 2012 |
| Genre(s) | Puzzle |
| Mode(s) | Single Player |
Flow Free is a puzzle game developed and published by American studio Big Duck Games for iOS and Android in June 2012.[1] As of 2022, the original game has received more than 100 million downloads, with its various variants receiving additional millions more.[2]
Flow Free presents numberlink puzzles. Each puzzle has a grid of squares with pairs of colored dots occupying some of the squares. The objective is to connect dots of the same color by drawing 'pipes' between them so that the entire grid is occupied by pipes. However, pipes may not intersect. Difficulty is primarily determined by the size of the grid, ranging from 5x5 squares (3 colors) to 15x15 squares (up to 16 colors). Many grids are "open" and some contain "walls" which must be navigated around. Whenever a level is completed, a check mark will appear on the level select icon to indicate that the puzzle is solved, while a star indicates a "perfect" game, where the player finished the puzzle with the fewest moves required. The app also contains additional paid packs as well as a time trial mode.[3][4]
Big Duck Games has also released three expansions in the series. The first expansion, "Flow Free: Bridges", was released on November 8, 2012, at a fixed price. In this expansion, pipes can be made to intersect through pre-made bridges.[5] The second expansion, "Flow Free: Hexes", was released on October 12, 2016, and features both free and paid premium puzzles. The gameplay is similar to "Flow Free" except the layout resembles hexagons instead of squares.[6] The third expansion, "Flow Free: Warps", was released on August 8, 2017.[7] This expansion allows pipes to warp from an edge of the map to another edge of the map.
According to a 2022 paper by Eammon Hart and Joshua A. McGinnis, Flow Free is NP-complete, meaning computers cannot solve the puzzles in polynomial time as complexity increases, building upon a collaborative 2014 paper.[2][8]