At some point, we all have to deal with some kind of allocation application. The larger the matrix, the more difficult it becomes to find the best combination in a optimal way. This is where the Hungarian algorithm excels.
Recently I came into contact with finite state machines in Laravel for the first time while researching an implementation for one of our customers. In this blog I want to briefly explain what such a state machine is and what we can use its functionalities for.