Search results for query: *

The rules I used, and which I believe to be exactly what Mrs. Perkins's Quilt problems are governed upon are: 1) All dissections must be squares, and cannot just be themselves. 2) Only prime dissections are allowed NOTE* I figured out that prime dissection means that all the pieces cannot...

Thanks for your help, I managed to complete the code. It works sufficiently well. I ended up using PGplot because it looks nicer lol and I used squares with only 1's. If you ever want to see the code I wrote, which is actually very long even though I used recursive subroutines I can show you...

Yeah that is true I can try that. I am going to work on it today and see how I can integrate the drawing scheme into my program. I think pgplot might be easy too though, they have built in subroutines to draw rectangles using coordinates. And those coordinates I can extract from my matrices. But...

Well I figured out a working algorithm and programmed it sufficiently well. It can calculate the solutions of n=1-6 exactly. n > 6 the calculated solution is off by 1 compared to the known until n = 17. From N= 17- 400 it ranges from 2 to 3 off the known best solution. I represented the squares...

Yeah that is true, I am unsure of the rule to it as well. But the rules I want to program for are the following: 1)Only squares can be used to break down the main square. 3)The solution should be done using a minimum number of squares. 2)The solution must contain at least one 1x1 square. For...

Hi this is my first time posting on this forum, mainly because I am new to Fortran. I have to do a project based on a problem called Mrs. Perkin's Quilt. I posted a link at the end for further info in case of any confusion. The basic idea is to take an nxn square and dissect it into smaller...