From c805bdb460173d23a295a68ec93be4f781a0c647 Mon Sep 17 00:00:00 2001 From: massoncorlette Date: Thu, 7 Nov 2024 04:11:49 -0500 Subject: [PATCH] I believe that mentioning the adjacency list with this line can really add a lot of value for this exercise, I struggled far too long overlooking the added line --- javascript/computer_science/project_knights_travails.md | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/javascript/computer_science/project_knights_travails.md b/javascript/computer_science/project_knights_travails.md index d0629cfdbd..06a3772f0f 100644 --- a/javascript/computer_science/project_knights_travails.md +++ b/javascript/computer_science/project_knights_travails.md @@ -20,7 +20,8 @@ Thus, the problem of finding the shortest path for the knight’s movement becom #### Vertices and Edges The vertices in this graph are each of the possible positions on the chessboard, represented by a pair of coordinates like `[x, y]`, where x and y are between 0 and 7. -The edges are the valid knight moves between vertices. For example, from `[0,0]`, a knight can move to `[2,1]`, `[1,2]`, and so on. Each of these moves represents a connection between the vertex `[0,0]` and the other reachable vertices. +The edges are the valid knight moves between vertices. For example, from `[0,0]`, a knight can move to `[2,1]`, `[1,2]`, and so on. Each of these moves represents a connection between the vertex `[0,0]` and the other reachable vertices. Consider how you can use an adjacency list in +order to return the shortest path. #### Graph Representation