Can anyone explain me how to optimize the backtracking algorithm of Knight Tour so that it passes all the testcases. Also, where can I find detailed explanations and solutions to cses problems? I found a explanataion of graph problems by some guy in codeforces but I was unable to understand what I have to sort in the knight tour.
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3856 |
| 2 | jiangly | 3747 |
| 3 | orzdevinwang | 3706 |
| 4 | jqdai0815 | 3682 |
| 5 | ksun48 | 3591 |
| 6 | gamegame | 3477 |
| 7 | Benq | 3468 |
| 8 | Radewoosh | 3462 |
| 9 | ecnerwala | 3451 |
| 10 | heuristica | 3431 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | -is-this-fft- | 162 |
| 3 | Dominater069 | 160 |
| 4 | Um_nik | 158 |
| 5 | atcoder_official | 156 |
| 6 | adamant | 152 |
| 6 | djm03178 | 152 |
| 8 | Qingyu | 149 |
| 8 | luogu_official | 149 |
| 10 | awoo | 147 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2025 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Feb/20/2025 14:22:10 (i1).
Desktop version, switch to mobile version.
Supported by
A simple pruning that you can do is prioritizing going to adjacent spots that have less options. This should be enough, however do you want a more in depth explanation? I think you can figure out why this works