Author: Unknown
Subject: Questions about hash table
Date: Monday, 06 Apr 2020, 18:00:47

A few questions about Hwk5:

1. We don't need to store POSITION in the hash table because it's the key. We only store REACHED-FROM and NSTEPS in the hash table. Is this right? 

2. Should the arrays we use for chaining be arrays of structs so that we can store REACHED-FROM and NSTEPS at a single index?

3. Should we keep the strings of positions (e.g., "12345678-") as one dimensional character arrays or would it help to rearrange them into two dimension character arrays that resemble the puzzle tray?