From a74b8e24041c0e192bff28b9de9fed8c71202847 Mon Sep 17 00:00:00 2001 From: Kelly Popko Date: Wed, 14 Aug 2024 01:58:23 -0500 Subject: [PATCH] fix(ruby): Fix typo in Knights Trevails --- ruby/computer_science/project_knights_travails.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/ruby/computer_science/project_knights_travails.md b/ruby/computer_science/project_knights_travails.md index f02073cf1dd..82338e98dec 100644 --- a/ruby/computer_science/project_knights_travails.md +++ b/ruby/computer_science/project_knights_travails.md @@ -31,7 +31,7 @@ Sometimes *there is more than one fastest path*. Examples of this are shown belo
1. Think about the rules of the board and knight, make sure to follow them. -1. For every square there is a number of possible moves, choose a data structure that will allow you to work with them . Don't allow any moves to go off the board. +1. For every square there is a number of possible moves, choose a data structure that will allow you to work with them. Don't allow any moves to go off the board. 1. Decide which search algorithm is best to use for this case. Hint: one of them could be a potentially infinite series. 1. Use the chosen search algorithm to find the shortest path between the starting square (or node) and the ending square. Output what that full path looks like, e.g.: