From 96f95dd82c47d79bffcb8a0738b8f36bcf8e4447 Mon Sep 17 00:00:00 2001
From: jhaayushofficial <115531575+jhaayushofficial@users.noreply.github.com>
Date: Mon, 17 Oct 2022 19:00:16 +0530
Subject: [PATCH] Create ayush

---
 ayush | 5 +++++
 1 file changed, 5 insertions(+)
 create mode 100644 ayush

diff --git a/ayush b/ayush
new file mode 100644
index 0000000..4c41f4d
--- /dev/null
+++ b/ayush
@@ -0,0 +1,5 @@
+Tower of Hanoi is a mathematical puzzle where we have three rods (A, B, and C) and N disks. Initially, all the disks are stacked in decreasing value of diameter i.e., the smallest disk is placed on the top and they are on rod A. The objective of the puzzle is to move the entire stack to another rod (here considered C), obeying the following simple rules:
+
+Only one disk can be moved at a time.
+Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack i.e. a disk can only be moved if it is the uppermost disk on a stack.
+No disk may be placed on top of a smaller disk.