Pass

**Very well done Elias!**

Love the graphics! Your code is well structed.

However, my spagetti sences noticed, finn två optimeringar:
_All occurences of "`possible_moves`"_:
```rust
let mut possible_moves: (Vec, Vec>) = (vec!["".to_string()], vec![vec![]]);
//...
possible_moves = (vec!["".to_string()], vec![vec![]]);
//...
possible_moves = game.get_possible_moves(&vec![c, r], true);
//...
if let Some(_) = possible_moves.1.iter().find(/*...*/) {/*...*/}
```

Start by reviewing every occurrence of possible_moves in the Rust code shown in the issue, including its initialization, reset, assignment from game.get_possible_moves, and iteration. Determine the two intended optimizations from the surrounding code; the issue is complete only when both are identified and their behavior is covered without changing the chess GUI's results.

Written by the indexing model from the issue text.