<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>algorithms on Akshay Chauhan</title><link>https://akshay-chauhan-000.github.io/tags/algorithms/</link><description>Recent content in algorithms on Akshay Chauhan</description><image><title>Akshay Chauhan</title><url>https://akshay-chauhan-000.github.io/cover.png</url><link>https://akshay-chauhan-000.github.io/cover.png</link></image><generator>Hugo -- 0.164.0</generator><language>en</language><lastBuildDate>Sun, 09 Aug 2026 01:44:18 +0530</lastBuildDate><atom:link href="https://akshay-chauhan-000.github.io/tags/algorithms/index.xml" rel="self" type="application/rss+xml"/><item><title>Pathfinding on Energy Landscapes</title><link>https://akshay-chauhan-000.github.io/simulations/pathfinding/</link><pubDate>Sat, 08 Aug 2026 00:00:00 +0000</pubDate><guid>https://akshay-chauhan-000.github.io/simulations/pathfinding/</guid><description>From a maze to the Müller–Brown surface with one cost function: Dijkstra and A* hunting the lowest route between two minima, with temperature deciding what &amp;rsquo;lowest&amp;rsquo; means.</description></item></channel></rss>