Learning path
Finding the best solution
Set up an optimisation problem and solve it by hand: linear programme, matching, gradient descent, search through a tree of possibilities.
2 steps · 7 decks
The steps, in order
Each step opens once the one before is well under way. Tap a deck to see its topics and a few cards.
- Step 1
Optimising
- Step 2
Searching the possibilities
- The badge to earn
Optimiser
It is yours once every step is mastered.
Explorer
The maze and the game
A maze to trap, an AI to beat
The path leads to this Explorer, where you get your hands on what its decks have you study.
Open the ExplorerPart of these courses
- Computer science B.U.T., second year, Application development track
- Computer science B.U.T., second year, Deploying connected and secure applications track
- Computer science B.U.T., second year, Data administration, management and use track
- Computer science B.U.T., second year, Application integration and information system management track
The first step fits in one session.
Free: the whole library, unlimited reviews, no ads. See pricing