Tile Stacking Problem

A stable tower of height n is a tower consisting of exactly n tiles of unit height stacked vertically in such a way, that no bigger tile is placed on a smaller tile i.e. we can place a tile of size smaller than or equal to the last tile placed onto the stack. An example configuration is shown below :

Read this article to understand Tile Stacking Problem in depth

Have a doubt or thought? Join the discussion now

This is a companion discussion topic for the original entry at http://iq.opengenus.org/tile-stacking-problem/