- Видео 8
- Просмотров 31 122
Learn by Example
Добавлен 11 окт 2020
Hello! I am Himangshu, and this channel is all about solving problems and understand deeper concepts in computer algorithms, physics and math. I believe the best way to understand anything is through an example, and hence, this channel is a small effort to explain my understanding of a concept by means of a problem or puzzle that uses the concept.
If you'd like to support my endeavour to create such content more regularly, you can support me via Patreon : patreon.com/LearnbyExample
If you'd like to support my endeavour to create such content more regularly, you can support me via Patreon : patreon.com/LearnbyExample
Advent of Code 2023 in Rust - Day 6 : Wait for it
Continuing my AOC 2023 series in Rust, I present 3 different approaches to solving today's problem.
Просмотров: 85
Видео
Advent of Code 2023 Visualised! Day 01 - Trebuchet?!
Просмотров 7211 месяцев назад
This year I'm trying to solve some AOC problems again, this time in Rust. I thought it'd be cool to do some terminal visualizations alongside as many AOC problems in the past have had a nice visual angle. Stay tuned for more cool stuff as the days progress! Code : github.com/hsaikia/Advent-of-Code/tree/main Join my private leaderboard : 1024366-4eaeb2bd
Procedural Trees in Bevy
Просмотров 2,1 тыс.Год назад
A simple bevy plugin to generate infinitely diverse procedural trees! Keeping up with the spirit of this channel - we'll attempt to learn various different programming concepts, algorithms and ideas by using them in an example project. Please send in your suggestions! Code : github.com/hsaikia/ProceduralTreesBevy Patreon : patreon.com/LearnbyExample Music by Bensound.com/royalty-free-music Lice...
![[LeetCode in Rust] N-Queens](http://i.ytimg.com/vi/PGxOOD9MRLY/mqdefault.jpg)
[LeetCode in Rust] N-Queens
Просмотров 166Год назад
Here we solve the N-Queens problem in Rust. How many ways can N queens be placed in an NxN chessboard? Why Rust? Rust is a fast, memory-safe, modern language which has been the most loved language for developers (according to the StackOverflow developer survey) for 7 years in a row. Keeping up with the spirit of this channel - we'll attempt to solve different LeetCode problems in Rust. Please s...
Solving the Travelling Salesman Problem using Ant Colony Optimization
Просмотров 28 тыс.3 года назад
I was tinkering around with the Godot game engine, and decided to write this TSP solver using ACO over a weekend. Hope you enjoy the video! The code can be found here : github.com/hsaikia/TravellingSalesmanGodot
How does a Chess Engine make a move?
Просмотров 4113 года назад
Xewali Chess (github.com/hsaikia/XewaliChess) is a UCI compatible Chess Engine written in C . This video describes the most important ideas that went into the development of Xewali Chess, as well as explains a few basic concepts about Chess Engines in general.
![[Spoj Problem Solving] Prime Intervals - Segmented Sieve of Eratosthenes](http://i.ytimg.com/vi/z1HRVAJJuuw/mqdefault.jpg)
[Spoj Problem Solving] Prime Intervals - Segmented Sieve of Eratosthenes
Просмотров 3794 года назад
In this video, we solve the problem of finding all prime numbers in a given range using the 'Segmented Sieve of Eratosthenes' algorithm.
![[Spoj Problem Solving] Aggressive Cows - Binary Search](http://i.ytimg.com/vi/JjloBtbz0EQ/mqdefault.jpg)
[Spoj Problem Solving] Aggressive Cows - Binary Search
Просмотров 1654 года назад
Problem link: www.spoj.com/problems/AGGRCOW/
This was very cool. Thanks for sharing this with us. It might be better to use a larger font size so we can see the code your are showing more easily. I’m just getting started in Bevy, so it is cool to see what other people are doing in it.
It has a lot of potential, awesome work!
This is great, please continue, the content is great.
Fascinating. Thank you. I'm going to study this in depth as it looks really interesting.
Amazing would love to see other procedural objects or more parameters like leaf shape. A procedural forest would be amazing
Stay tuned!
You are amazing this helped me so much
Hi Jintu Dada, I'm glad to see your new video after such a long time. I hope you are doing well😊.. I have some important things to talk to you about, so please let me know when you are free. I will reach out to you on Hangouts soon ..
tsp is not np-complete...
I used your code but it only generated graph. What do u do to auto solve after run?
You got to check the key binding for the 'optimize' action.
Really good Video:) thank you 😊
What if my graph have n number of nodes, how can I modify the ACO to travel from a specific source to a specific destination without passing through all the n number of nodes but only the nodes to the destination and that's it?
You just have to sample paths from the source S to the destination D, rather than all sources and destinations.
this doesnt account for alternative directions and axis since its an ant colony you should have 6 axis (up and down) of direction instead of 4 (compass directions)
The graph is a planar embedding only, actual physical paths can be three dimensional sure.
I hate those damn salesmen can't they solve they problems? I already have problems by my own!!
😅😅 this is quite easy
Hi sir can i contact you i have a TSP problem where i work in Indonesia, i would be very happy if you give your email address so i can contact you Thank you
Nice video. I should probably try to implement this
thanks alot for ur great work
At around 9:45, I mention that the maximum prime that we need to compute is sqrt(U). Basically what I meant to say is p <= sqrt(U) and hence p_max = sqrt(U). At around 14:00, I confuse the explanation of p_max again in the code. The comment should just read ‘max prime number to compute’. Or ‘lower bound of the prime number range to compute’. Apologies for completely messing up an explanation that should be clear enough to you :)
Correction : At 4:36, we are looking at positions which are a distance of 4 units apart, hence after 8, the next value should be 12 or greater, and not 13 or greater as I mentioned in the video.