Scratch Challenge: Magic Squares скачать в хорошем качестве

Scratch Challenge: Magic Squares

Two algorithms are implemented to find magic squares with simple scratch programs. 1) Monte-Carlo like approach 2) Backtracking algorithm As a challenge the viewer is asked to modify the backtracking algorithm such that only perfect magic squares are found. A technique for finding magic squares for odd numbers of rows and columns is presented as one example for explicit construction strategies. The scratch tutorials can be found at: https://scratch.mit.edu/projects/5247... (Monte-Carlo) https://scratch.mit.edu/projects/5276... (Back-Tracking) A file with all 4x4 magic square configurations can be downloaded here: https://www.dropbox.com/s/2dfyzpo4nmz... The slides are created with the manim package (community edition): https://www.manim.community/ The python source for the slides can be found in the github-repository: https://github.com/mathelehrer/manim.git