how to calculate number of states for this logistics problem? Consider a logistics problem with 3 cities, 5 trucks and 3 packages. Each truck can be at any of the locations. A package can either be at one of the locations or in one of the trucks. What would the number of states be if an atomic representation is used?
would the answer be 5 (num of trucks) x 3 (num of cities) x 3 ^ 8 (packages can be in a city or a truck) x 8?
I feel like this is completely wrong. Can anyone give me a breakdown on how to solve these types of problems?
Thank you

For Atomic Presentation, the total number of states would at least be $n^{p+t}$, where $n$ is the number of cities, $p$ is the number of packages, and $t$ is the number of trucks. In this case, the least states are: $3^{5+3} = 6561$.
