Jump to content
BrainDen.com - Brain Teasers

Leaderboard

Popular Content

Showing content with the highest reputation on 11/23/18 in Posts

  1. The answer should be 25. My "proof" is a brute force programming solution. I have a psuedocode c++ bruteforce solution. I can give the full version if requested. It takes a few seconds to brute force all possible paths. This might count as a proof, depending on if you trust the computer to be reliable. Basically what it does is it generates all possible paths, and then prunes as it goes along so the program dosen't take basically forever, or 6^27 moves. Now a proof will involve some theorems in graph theory, which I don't yet know all that well.
    1 point
×
×
  • Create New...