Projects Tagged with "algorithm"
Binary Maze
By: thecooltodd
Views: 2660 | LoveIts: 25
Description: This is a VERY SIMPLE random maze generator. In fact, it is virtually one of the simplest maze algorithms possible, taking me only half an hour to program it. Download this program and you'll see the code itself should be fairly simple (18 lines of code).
Double Dragon
By: Jens
Views: 1028 | LoveIts: 44
Description: Yet another variant, I know it gets boring... (You can start to see the rainbow pattern at about the 8th iteration)
Sorting Algorithm Animation
By: ngmr
Views: 748 | LoveIts: 30
Description: This project animates some sorting algorithms. Buttons at the upper left show sorting types (Selection sort, Insertion sort, Bubble sort, Quick sort and Merge sort). A slider at the lower right means a number of points.
sierpinski snowflake and other algorithms
By: billyedward
Views: 634 | LoveIts: 8
Description: This project shows how powerful simple math can be. Inspired by a lesson given by my math teacher illustrating how the midpoint of a line can be used to make a sierpinski triangle, I decided to play with the algorithms a bit. They are: 0 = snowflake 1 = sierpinski 2 = split sierpinski 3 = simple int ... show more
1s1s Pathfinder (Dijkstra's Algorithm)
By: wwjd3
Views: 503 | LoveIts: 22
Description: This is just like my previous project, but I optimized it and made it 1s1s! It should now run slightly faster. This project uses Dijkstra's algorithm to calculate the shortest path through a stage. This is a simplified version of the algorithm showing the recursive algorithm on a 10x10 grid of node ... show more
hanoi_&_its_graph_V1_1
By: grandloup
Views: 432 | LoveIts: 17
Description: Hanoi and its graph - V1.1 ________________________________________ The tower of Hanoi with 6 disks and the corresponding graph are displayed on the scratch-screen. The graph resembles a Sierpinski-Carpet. The nodes represent the possible distributions of the disks. The edges of the graph repr ... show more
Euclid's algorithm - GCD-LCM Calculator
By: dapontes
Views: 394 | LoveIts: 7
Description: A GCD and LCM calculator based on Euclid's algorithm (ELEMENTS, Book VII, Propositions 1-2). For a good explanation of Euclid's algorithm look at http://en.wikipedia.org/wiki/Euclidean_algorithm (Thanks Paddle2See!)
Fast circle algorithm
By: boisvert
Views: 373 | LoveIts: 9
Description: Draw a circle fast - similar to Bresenham's algorithm. It makes better looking circles than the turn/go forward method, especially at small radiuses. Yellow or green pen to draw the circle. Check the timer. The technique is used in drawing packages.
Drawing circles
By: boisvert
Views: 239 | LoveIts: 1
Description: Click the pen to draw the circle and the flag to clear the background. The technique is similar to Bresenham's algorithm. It makes better looking circles than the turn/go forward method and uses only integer arithmetic. Not so much a game as a technique you might want to copy.
magic_roots_V1_1
By: grandloup
Views: 236 | LoveIts: 9
Description: magic_roots Version 1.0 This program computes the digits of square roots. It is based on a spigot algorithm: the generated digits of the roots drop one at a time. _________________________________________ Caution! Only the downloaded version computes the digits properly. ____________ ... show more
Maze Creator and Solver--BFS, DFS, Best *FINISHED*
By: Tux
Views: 189 | LoveIts: 6
Description: Repeat (10): |Repeat (50): ||Creates maze. ||Solves it with 3 pathfinding ||algorithms. ||Creates new maze. |___________ |Change maze's cycles by (50) |__________ PS: (1) DATA INCLUDED IN LISTS WHEN RUN 100 TIMES! (2) If you want to see the paths of all 3 algorithms,download and activate ... show more
Towers of Hanoi
By: beetle16
Views: 143 | LoveIts: 2
Description: Code that plays towers of hanoi. Press space to force a move.
algorithm-sally
By: keithbraafladt
Views: 135 | LoveIts: 0
Description: not finished! this is the start of doing the whole algorithm dance
Fibonacci
By: dapontes
Views: 122 | LoveIts: 4
Description: I used a list to present the Fibonacci's numbers. For the number of pairs i used the equation fn+2=fn+fn+1.
One method of mapping one dimension to two
By: DarthPickley
Views: 119 | LoveIts: 0
Description: encodes as a decimal sequence and then de-hashes the sequence into even and odd parts. an infinte sequence split into two is two infinite sequences. therefore the unit interval has as many points as the unit square (Aleph 1)
Game of life
By: billyedward
Views: 111 | LoveIts: 3
Description: Inspired by John Conway's "Game of life" this scratch version does the same thing. Operating on a "life" algorithm, cells will "survive" if they only have 2 "neibours" and dead cells will "grow" if they have three. the original 11x7 box that appears ... show more
labirynt
By: przemko
Views: 110 | LoveIts: 3
Description: John Pledge's algorithm for disjoint mazes. -- Implementacja algorytmu opracowanego przez dwunastoletniego Johna Pledge'a z Exeter. Kliknij w dowolnym miejscu labiryntu a duszek, omijając czarne ściany, dobiegnie do czerwonej linii znajdującej się na zewnątrz labiryntu. Gdy duszek nie poru ... show more
cube_root_graph
By: dapontes
Views: 81 | LoveIts: 1
Description: Calculation of the cube root of a number (a)and initial value of cube root x0. This is a remix of my project "Heron's square root" but now i use a List. Press the buttons (1.2..) to start.
SimplePrime
By: kevinsullivan
Views: 77 | LoveIts: 1
Description: This program uses a simple algorithm to decide whether a given positive integer is prime or not. Enter the number to check as the value of the variable called isItPrime, then run the program. The Scratch Cat will give you the answer!
sorts
By: cs105
Views: 74 | LoveIts: 0
Description: Compares two sorting algorithms. Set n to the number of items to sort. Click on deck to create a random list. Click on brown hat to sort via selection sort (O(n^2)). Click on white hat to sort via binary search sort (O(n log n)).
Largest/Smallest finding algorithm
By: AlanProjects
Views: 74 | LoveIts: 2
Description: I've been intrested in math lately, and especially algorithms. This algorithm will tell you the largest and smallest numbers in a sequence. Instructions are in the project. It is fully commented if you want to see how it works. NOTE: YOU MUST DOWNLOAD FOR IT TO WORK. I AM TO BUSY TO PUT IN A NUMBER ... show more
Heron_square_root
By: dapontes
Views: 73 | LoveIts: 1
Description: Calculation of the square root of a number (a) by Heron's method. Click on the buttons (1,2...5) to start.
Line segment intersection
By: moffboffjoe
Views: 73 | LoveIts: 4
Description: YOU MUST USE FLASH! (or else lines wont draw) I'm trying to make some good advanced player physics and I needed some line segment intersection checks using only maths and position inputs, so I made this. If you have a better (faster) solution to this, then please do tell. Move the points around t ... show more
Sort_opt
By: barndt
Views: 69 | LoveIts: 2
Description: I optimized the bubble sort as described in http://en.wikipedia.org/wiki/Bubble_sort It's now faster than Selection Sort and needs ~64% of the time it consumed before. Original description from Jens: This project compares three sommon simple sorting algorithms (bubble, selection, insertion) agains ... show more
Sieve of Eratosthenes
By: AlanProjects
Views: 62 | LoveIts: 2
Description: A algorithm to find prime numbers. Select how many you wish to go up to and click the flag
curve area
By: DarthPickley
Views: 56 | LoveIts: 4
Description: area is now positive + for polygons drawn clockwise CW and negative - for polygons drawn counter-clockwise CCW Click Space to clear I have changed some features to improve them, including a glitch where it calculates twice the area instead and allowing to create polygons instead of curves. click ... show more
Self Organizing Grid
By: abee
Views: 50 | LoveIts: 4
Description: Yet another grid algorithm. This project uses self organizing method. There are no central controllers. Each sprite has a same script. And they search empty grid in parallel.
Mastermind Solver
By: cygene
Views: 38 | LoveIts: 3
Description: If going to download, do not save at each use, as this will delete the solutions list. Also, please love-it if downloading or if you do. USE TURBO SPEED, EVEN AT OFFLINE. DO NOT USE FLASH, USE EXPERIMENTAL VIEWER OR DOWNLOAD This is, to my knowledge, the first mastermind-solving algorithms writt ... show more
Super Equation Solver 2.0
By: Ro555
Views: 38 | LoveIts: 0
Description: Enter the terms (up to x^3) for both sides of the equation then click Solve and it will give the value(s) of x. Very fast at calculating the answer except for very large/complex numbers. Please expand all brackets first. Have fun! New in Version 2.0: -Minor glitches fixed -Faster solving time -I ... show more
Grid2
By: abee
Views: 36 | LoveIts: 2
Description: All balls are forced to locate on a grid. This grid is defined as lists of x and y. And a semaphore is used for access control of the list.
Base Converter
By: legolover
Views: 35 | LoveIts: 1
Description: OH NO. IN BASE 2, THE RESULT IS TOO BIG TO DISPLAY FOR NUMBERS OVER 63 AND IT GIVES SOME "E" THING! Self-explanatory. I was literally ripping my hair out to get the formula!
bubble sort redo
By: nightandday64
Views: 35 | LoveIts: 0
Description: Found this on here, but with a few errors. It now correctly creates and sorts a full list of random variables, and has a spiffy background!
Check Prime Function
By: Ro555
Views: 33 | LoveIts: 1
Description: Enter a value then it will check if it is a prime number. Long or complex numbers take longer so be patient. I hope you find it useful!
Spring Simulation
By: wimerrill
Views: 30 | LoveIts: 1
Description: DIRECTIONS: 1) Click a spot on the screen within forty-five Scratch pixels of the sling shot. KEEP THE MOUSE PRESSED DOWN. 2) Release -- this fires the sling shot. 3) Repeat. Looks better when downloaded.
Sleep Sort
By: abee
Views: 28 | LoveIts: 3
Description: An implementation of sleep sort by Scratch. http://dis.4chan.org/read/prog/1295544154
One Blind Mouse
By: popswilson
Views: 25 | LoveIts: 1
Description: One Blind Mouse — The mouse may not be able to see but makes up for it by having an extra-sensitive nose. The mouse can smell cheese and knows as it taps its way along whether the scent is getting stronger or weaker because the scent's strength is proportional to the mouse's distance from the chee ... show more
3d Objects 2
By: decillion
Views: 22 | LoveIts: 1
Description: my latest edition to an earlier project, 3d objects! new in v2.0: •Two objects added! •Center of rotation-soon you'll be able to move it too!
Day of the Week Calculator
By: Bradley123
Views: 22 | LoveIts: 1
Description: Type the date in the format: DD/MM/YYYY This actually works for the Julian Calendar, which was used before the Gregorian came about in 1752, and the Gregorian, for years after 1752. I think the Julian Calendar started one the month March and ended in December, but I'm not so sure.
Grid
By: abee
Views: 18 | LoveIts: 0
Description: All balls are forced to locate on a grid. This grid is defined as lists of x and y. And a semaphore is used for access control of the list.
Avoidance algorithm
By: greenmarble
Views: 16 | LoveIts: 0
Description: The cat is trying to touch the grasshopper. The point of this project is to make an algorithm for a computer controlled sprite to make its way through a landscape with barriers. It's not very smart. Scratch moves toward the grasshopper. If he touches a barrier he bounces off at a semi-random angle. ... show more
shuffle
By: lindaguo
Views: 16 | LoveIts: 0
Description: The animation of shuffle algorithm. Click green flag on the top right corner to start the application. The animation is triggered every time the Shuffle button is clicked. Each time, the script will choose two elements to switch positions with one another. Current variable represents the selected e ... show more
Path finder A* Algorithm
By: iuval
Views: 16 | LoveIts: 0
Description: Hey! This is my way of using the A* algorithm in Scratch( http://en.wikipedia.org/wiki/A*_search_algorithm ), to find a path from the start point to the target. This algorithm uses backtraking, so if you do not play it in Turbo Mode(Shift-Click green flag) you will be realy old when it finishes :D ... show more
100Doors
By: Midlandman
Views: 16 | LoveIts: 0
Description: A Scratch implementtion of the 100 doors problem See http://rosettacode.org/wiki/100_doors for further details. Just press each button in turn to progress throught the simulation. Enjoy!
hexagone puzzle solver
By: creepy_and_cute
Views: 15 | LoveIts: 0
Description: The original puzzle is made of wood with numbers instead of the colored borders of the hexagones. The scripts from the witch solve the problem recursively. Just watch ...
Willy and the Search Algorithms
By: cclyde
Views: 13 | LoveIts: 0
Description: Poor Willy needs to find his friend Tom Pichler's phone number in the white pages. However, he needs to find out which page his friend is listed on - and he needs your help for that. He can only move forward and backward in the phone book and when he is on a page, he can view the name of the person ... show more
Algorithme €
By: MousGK
Views: 11 | LoveIts: 0
Description: Algorithme permetant de diviser une somme d'argent en 10,2 et 1 €
Algorithm (sorta)
By: lubydo
Views: 8 | LoveIts: 0
Description: Yep, for math. Instructions inside. I'll probably come out with a ~more organized~ version. I wanna do this with python. Oh flip, I just realized I did this wrong.
Evolution of lists
By: farcool
Views: 7 | LoveIts: 1
Description: Explanation http://scratch.mit.edu/projects/farcool/2260446 It is basicly a script that decides what "Strategy" list is better. Then clones and mutates it. 1 creates fuel. 2 turns fuel into energy. 3 turns energy into score. 0 does nothing. Press the squares to insert other values.
Rover Directional Algorithm
By: cessna
Views: 4 | LoveIts: 0
Description: You can drag the rover and the flag around the map. Press the buttons in the following order: Set, Turn, Go! The rover will then go to the flag.
Euclid gcd
By: ndjapic
Views: 4 | LoveIts: 0
Description: This is how ancient Greek mathematician Euclid would find greatest common divisor (gcd) for numerator and denominator of a fraction. Sequence of numbers named Euclid starts with numerator and denominator for which we have to find gcd. Each subsequent number in the sequence is remainder of division b ... show more
