Packing Squares 1-24, times two

Corrected Bouwkamp code (may or may not agree with pictured) Computer solutions for problems 1-10.
Brute force, greedy backtracking algorithm:

Problem #1: 49 27 27 (6,6,6,6,3)(3)(6,6,6,6,3)(3)(5,5,5,5,5,2)(2)(2)(5,4,4,4,4,1,1,1,1)(5,1)(1)(1)(4,4,3,3,2)(1)(5)(1)(4,4)(3,3)(2,2,2,2)

Problem #2: 43 29 29 (7,7,7,7,1)(1)(1)(1)(1)(1)(1)(7,7,6,6,3)(3)(6,6,3)(6,4,4)(3)(2,6)(5,3,3,4)(4,4)(2,2,2)(4)(5,5,5,5,5)(2,2)

Problem #3: 44 32 32 (8,8,8,8)(8,7,7,7,3)(3)(3)(1,1,1,1,1,1,1,7,5,2)(6,6,3)(5)(3)(5)(6,6,6,2,2)(5)(2,1,1)(7)(2)(5)(4,4,4,4,4)

Problem #4: 49 35 35 (8,8,8,8,3)(3)(3)(8,8,7,7,2)(3)(2)(5)(1,1,1,1,1,1,6,2)(6,4,7,5)(7)(4)(2,6,3)(6)(5,4)(4)(5,5)(1,3,4,2)(7,7,2)(6,6)(5)(4)

Problem #5: 31 34 34 (10,10,9,5)(5)(1,1,1,5,1)(7,7,7,2)(6)(2)(3,4)(2,4)(9,9,6)(6)(4)(3,3)(10)(8,8,8)

Problem #6: 45 45 45 (11,11,11,10,2)(2)(2)(2)(1,1)(1,1)(1,11)(9,9,8,8)(9,7)(10,8)(5,6)(5,7)(6)(7,7,3)(10)(8)(9,4)(10,4)(4)(6,6)(5,5)(4)(3,3,3)

Problem #7: 49 51 51 (12,12,12,12,3)(3)(3)(3)(11,11,11,11,7)(7)(10,10,10,8,6)(7)(6)(8)(9,9,8,4)(7)(6)(4)(2,4,2)(1,6)(10,2,2)(5,4)(9,9)(8)(1,1,1,1)(5,5,5)

Problem #8: 46 61 61 (15,15,15,12,4)(4)(4)(3,13)(14,14,14,6)(6)(13)(2,2,2)(13,10,7,9,9)(7)(12,9,10)(10)(8,5)(7)(3,1,1)(3,6)(1,1)(5,5)(12)(11)(11,11)(8,8)

Problem #9: 66 64 64 (13,13,13,13,12)(12)(13,12,12,12,3)(3)(3)(3)(1,11)(1,1,1,1,1,11,11,9,4)(9,9)(4)(4)(2,7)(8,10)(11)(6,7,11)(4)(6,5)(6)(8)(5,2)(10)(2)(8,8)(5,7,7)(7,4)(8)(3,6)(10,10,10)(2,9,9)(2)(6)(5,5)

Problem #10: 49 67 67 (16,16,16,15,4)(4)(4)(3,1)(1)(1)(1,8,10)(13,14,11,11)(6,2)(12)(10,10,2)(13)(8)(14)(7,9,9,15)(13)(11,8,2)(6,14)(3,6,5)(15)(12,12,3)(5)(9)(7,7)(5)

Answer to problem #1 : 49 27 27 (6,6,6,6,1,1,1)(2,1)(1)(2,1)(1)(3)(6,6,4,4,4)(3)(4,4,4)(3)(6,6)(3,3,3,3,3)(5,5,5)(2,2,4,4)(2,2)(2,5,5,5,5,5)(2)(1,1) Hand solution using Visio