'Magic Square' algorithm
问题 As an experiment, I'm trying to create a magic square program that checks every possible square with nine numbers. For those who do not know, a magic square is a 3x3 grid of numbers 1-9, where each row, column, and diagonal add up to 15. For example: How would I go about checking each square using a table with Lua? I'm starting with the following table: local sq = { 1, 1, 1, 1, 1, 1 1, 1, 1 } How would I go about checking each table in the correct order? I'm able to draw out my thinking on