Based on Euler's unsolvable math problem 'The 36 Officers', which requires that in a parade of six regiments each containing six officers of six different ranks are to be placed so that in each row and column of a 6x6 square/parade formation there is only one officer from each regiment, and only one officer of each rank.
'36' is a visualization of a computer's attempt to solve this problem in the only possible way, with constant perfect timing, movement and speed.
36
- PriceUSD PriceQuantityExpirationFrom
- PriceUSD PriceQuantityFloor DifferenceExpirationFrom
36
- PriceUSD PriceQuantityExpirationFrom
- PriceUSD PriceQuantityFloor DifferenceExpirationFrom
Based on Euler's unsolvable math problem 'The 36 Officers', which requires that in a parade of six regiments each containing six officers of six different ranks are to be placed so that in each row and column of a 6x6 square/parade formation there is only one officer from each regiment, and only one officer of each rank.
'36' is a visualization of a computer's attempt to solve this problem in the only possible way, with constant perfect timing, movement and speed.