I can't express how much these tutorials have helped me!. I watched your Verlet tutorials and now i am putting together an engine to handle it all. Springs was sure fun too. I program in c++ but it's easy refactor. Thanks so much :D
Great tutorial again! I love the pacing on these videos and how easy they are to follow. Came to your channel today to look if you had any info on tesselation of a point cloud in 2d and 3d, didn't strike gold, but was wondering if this subject would be on your radar.
Maybe you can help me. I like to play with pentominoes: the 12 unique ways 5 squares can be joined so that all the pieces have at least one side touching another piece. I like to find solutions to the 6X10 rectangle. But the names of the pieces are confusing; usually named after the letters they closest resemble. But interpretations differ. One day I began to wonder if the 12 pentominoes could be somehow arranged numerically; in a unique, logical order 1 thru 12. I found one. But are there such paths through the higher sets? Here is the algorithm. Take a polyomino piece of any size set. Then move one of the units of that piece to an adjacent grid square, either laterally or diagonally, to form a different polyomino in the set. Then repeat until you have a formed _all_ the pieces in the set. For pentominoes, all arrangements dead end but one and the ends are the ----- piece and the + piece, the pieces with the least & most corners & vertices. These two pieces, no matter how large the polyomino set, must begin and end the path. To place them anywhere in the middle would require repeating a shape and each shape can only be used once. The path through pentominoes consists of 5 lateral moves and 7 diagonal. I backtracked down and found that there's no path through 4-unit tetrominoes but there is a one-move path through triominoes I brute forced 6-unit hexominoes but found no path. So 3 & 5 unit polyomino sets have a path through and can be numbered. Of course, once you find a path through all the pieces, either end can be the 1. But I like to start with the ----- piece cuz it looks like a 1. It appears that, for higher polyominoes, a path through all the pieces can only be found with certain sets: those that can end with a "+" piece of which all arms are of equal size. So ignoring 3, it goes, 5, 9, 13, 17, 21, 25 etc.. But as you can imagine, the numbers of permutations increases greatly with the size of the polyomino set. 12 pentominoes, 35 hexominoes, 108 septominoes, 369 octominoes etc.. But I'm curious: theory says there's a path through the 1,285 nonominoes. But is there? Is there only one? What about larger sets? Is there ever a path through polyominoes in between 5, 9, 13, 17 etc.? Grid based programming is the only way to search the higher polyomino sets for such paths. But once you find one, and if it's the _only_ one, the polyominoes of that set can be numbered. If there's a simpler algorithm, I can't find it.
im very new at coding and at this channel too, very great! but im a little confuse to the way you call the canvas and the "context, where i can find a video introducing me to that? thank, very great for the channe
I can't express how much these tutorials have helped me!. I watched your Verlet tutorials and now i am putting together an engine to handle it all. Springs was sure fun too. I program in c++ but it's easy refactor. Thanks so much :D
I love your videos. You are doing a great job with them and help a lot of people. Thank you!
Great tutorial again! I love the pacing on these videos and how easy they are to follow. Came to your channel today to look if you had any info on tesselation of a point cloud in 2d and 3d, didn't strike gold, but was wondering if this subject would be on your radar.
note the optical illusion on 4:40 :D
haha i was gonna say the same thing
Maybe you can help me. I like to play with pentominoes: the 12 unique ways 5 squares can be joined so that all the pieces have at least one side touching another piece. I like to find solutions to the 6X10 rectangle. But the names of the pieces are confusing; usually named after the letters they closest resemble. But interpretations differ. One day I began to wonder if the 12 pentominoes could be somehow arranged numerically; in a unique, logical order 1 thru 12. I found one. But are there such paths through the higher sets?
Here is the algorithm. Take a polyomino piece of any size set. Then move one of the units of that piece to an adjacent grid square, either laterally or diagonally, to form a different polyomino in the set. Then repeat until you have a formed _all_ the pieces in the set. For pentominoes, all arrangements dead end but one and the ends are the ----- piece and the + piece, the pieces with the least & most corners & vertices. These two pieces, no matter how large the polyomino set, must begin and end the path. To place them anywhere in the middle would require repeating a shape and each shape can only be used once. The path through pentominoes consists of 5 lateral moves and 7 diagonal. I backtracked down and found that there's no path through 4-unit tetrominoes but there is a one-move path through triominoes I brute forced 6-unit hexominoes but found no path. So 3 & 5 unit polyomino sets have a path through and can be numbered. Of course, once you find a path through all the pieces, either end can be the 1. But I like to start with the ----- piece cuz it looks like a 1. It appears that, for higher polyominoes, a path through all the pieces can only be found with certain sets: those that can end with a "+" piece of which all arms are of equal size. So ignoring 3, it goes, 5, 9, 13, 17, 21, 25 etc.. But as you can imagine, the numbers of permutations increases greatly with the size of the polyomino set. 12 pentominoes, 35 hexominoes, 108 septominoes, 369 octominoes etc.. But I'm curious: theory says there's a path through the 1,285 nonominoes. But is there? Is there only one? What about larger sets? Is there ever a path through polyominoes in between 5, 9, 13, 17 etc.? Grid based programming is the only way to search the higher polyomino sets for such paths. But once you find one, and if it's the _only_ one, the polyominoes of that set can be numbered. If there's a simpler algorithm, I can't find it.
where are you going to add next video
This was amazing. Wanted to know if it was possible for a video on light reflections?
speaking of grid. is there any chances that you will make a tutorial on spatial partitioning for games?
What do you mean by spacial positioning? Not familiar with the term.
Keith Peters
spatial partitioning like KD-trees and Quadtrees for optimized collision detections and fast lookup.
I doubt you never heard this two. :/
Yes, I know what you're talking about. Just hadn't heard it called that. I think that's on my master list.
Awesome vid!
im very new at coding and at this channel too, very great! but im a little confuse to the way you call the canvas and the "context, where i can find a video introducing me to that? thank, very great for the channe
The ending reminded me of matrices... oh, and, could you make a video about 2d or 3d raytracing?
Great video. It's a shame there are no new uploads.
thank you :D :D
cool