how to make a code that find all possible squares in big divide square.

i have a code that is divided several lines. this is a square.

 this is a picture and a code of square.

    hold on;
    plot([0 0],[0 8],'k-')
    plot([2 2],[0 8],'k-')
    plot([3 3],[0 8],'r-')
    plot([4 4],[0 8],'k-')
    plot([5 5],[0 8],'r-')
    plot([6 6],[0 8],'k-')
    plot([8 8],[0 8],'k-')   
    plot([0 8],[0 0],'k-')
    plot([0 8],[2 2],'k-')
    plot([0 8],[3 3],'r-')
    plot([0 8],[4 4],'k-')
    plot([0 8],[5 5],'r-')
    plot([0 8],[6 6],'k-')
    plot([0 8],[8 8],'k-')

    axis square;
    axis([-1 9 -1 9]);
    set(gca,'XTick',[0, 1, 2, 3, 4, 5, 6, 7, 8, 9])
    set(gca,'YTick',[0, 1, 2, 3, 4, 5, 6, 7, 8, 9])

what i want to do is make a code that finds all possible squares in this big divided square. also show it as a video(.avi). how should i do?

this is a part of completed avi that i want to make.