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

---
 README.md | 60 +++++++++++++++++++++++++++----------------------------
 1 file changed, 30 insertions(+), 30 deletions(-)

diff --git a/README.md b/README.md
index b1ccbf6..567154f 100644
--- a/README.md
+++ b/README.md
@@ -1,36 +1,36 @@
 Chess Engine Move Generator Comparison
 
-This code is from my two videos comparing different languages in one chess bitboard algorithm. 
-The constants are massive and almost everything is written in one function to maximize performance.
+This code is from my two videos comparing different languages in one chess bitboard algorithm.  
+The constants are massive and almost everything is written in one function to maximize performance.  
 
-Current results:
-C: 353.4ms
-C#: 768.4ms
-C++: 337.2ms
-D: 438ms
-Go: 685.8ms
-Java: NA, I will try using Java with longs when I have time.
-Nim: 533.6ms
-Odin: 505.8ms
-Python: 1,383,536ms or 22-23 minutes
-Rust: 536.4ms
-Swift: 585ms
-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
-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:
-c# example:
-
-Together:
+Current results:  
+C: 353.4ms  
+C#: 768.4ms  
+C++: 337.2ms  
+D: 438ms  
+Go: 685.8ms  
+Java: NA, I will try using Java with longs when I have time.  
+Nim: 533.6ms  
+Odin: 505.8ms  
+Python: 1,383,536ms or 22-23 minutes  
+Rust: 536.4ms  
+Swift: 585ms  
+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  
+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:  
+c# example:  
+  
+Together:  
 
         static int[,] move_list_global = new int[500, 4];
         static int[] move_counts = new int[10];
 
-or separate:
+or separate:  
       
         static int[] StartingSquares = new int[500];
         static int[] TargetSquares = new int[500];
@@ -38,7 +38,7 @@ or separate:
         static int[] Pieces = new int[500];
         static int[] move_counts = new int[10];
 
-Function example:
+Function example:  
 
         static int Perft(int depth, int ply)
         {
@@ -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.
-  Again this will break in any other position with lots of moves or with more depth.
+  The max moves I found using this approach was around 150, so the global array could 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.
+  I might test all code examples with 46 size move_list and global move_lists later.