Thread replies: 2
Thread images: 1
2016-01-27 00:08:10 Post No. 7813073
Post No. 7813073
Let F(r,c,n) be the number of ways to color a rectangular grid with r rows and c columns using at most n colors such that no two adjacent cells share the same color.
found a generalized formula for F(2, 2, n)
looking to extend this to F(r, c, n)
for 2x2 grids
because 1st cell has n choices, 2 cells adjacent will have n-1 choices followed by the last corner of (2n-3)
applying my logic to the 4*3 grid, i get something like 6*5^8*4*4*3 which is off by about 10 million.