Penyelesaian Permainan Flow Colors dengan Meminimumkan Deviasi Panjang Tiap Jalur

Abstract

Flow Colors is a puzzle game, where players must connect every pair of points of the same color with a pipe so that the pipes cover all the game areas with colors. Pipes with different colors should not be intersected/ overlapped. This problem can be modelled as a problem of making routes on a graph which is a modification of Traveling Salesman Problem (TSP). This study presents how to formulate puzzle of Flow Colors to minimize length deviation of the lines represented by the pipes by applying method of integer linear programming and solving it by using LINGO 11.0 computer software.