From ff9cfe8a15079576d7ef9bb8cb62a2f122d3a1e4 Mon Sep 17 00:00:00 2001
From: Coding with Tom <146443103+hcsalmon1@users.noreply.github.com>
Date: Sat, 18 Jan 2025 18:05:18 +0000
Subject: [PATCH] Update README.md

---
 README.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/README.md b/README.md
index 567154f..e557dc8 100644
--- a/README.md
+++ b/README.md
@@ -19,7 +19,7 @@ Zig: 348ms
   
 Feel free to make improvements to any of the code. Some notes:  
 -We test the opening chess position to depth 6. Target: 119,060,324 nodes  
--The max moves in a chess position are 220. I made moveList 250 just for safety. The max moves reached from any chess position  
+-The max moves in a chess position are 220. I made the moveList 250 just for safety. The max moves reached from any chess position  
 from the start is 46. So you can set the move_list to 46 elements without an index error but this will make the algorithm break   
 in any other position.  
 -Another approach is to make the move_list global and use an index like this:  
@@ -61,7 +61,7 @@ Function example:
             return nodes;
         }
 
-  The max moves I found using this approach was around 150, so the global array could that size.  
+  The max moves I found using this approach was around 150, so the global array could be that size.  
   Again this will break in any other position with lots of moves or with more depth.  
 
   I might test all code examples with 46 size move_list and global move_lists later.