-
π "I have no special talent, I am just passionately curious." ~ Albert Einsten.
Contributor @ Talkself.
π "I have no special talent, I am just passionately curious." ~ Albert Einsten.
Contributor @ Talkself.
Given a list of cities and the distances between each pair of cities, find the shortest possible route that visits each city exactly once and returns to the original city.
Kotlin 3
This project illustrates the use an algorithm (Network Bound Resource) for providing data to an app by either retrieving sufficiently recent data from a local cache, or loading the latest data fromβ¦
This project features a Tic-Tac-Toe game where the AI makes optimal moves using two powerful algorithms: Monte Carlo Tree Search (MCTS) and Minimax.
Kotlin 3
Vizualizing stochastic gradient descent on linear regression using p5.js. In neural networks,stochastic gradient descent is the most efficient algorithm discovered for training artificial neural neβ¦
JavaScript