Blog

Wisconsin Badgers.Read more

I wanted to implement this as short and effective as I could without using anything that is not basics, in order to improve my skills. I would appreciate input about things like memory leaks I missed, simpler way of doing things instead reinventing the wheel and styling. In general, does this implementation follows common bestRead more

I realize that there’re many implementations of Knight’s tour problem suggested across webs, without jumping to those suggested solutions (most in Java, I’m not proficient in Java), I managed to implement one myself using Python. It works and returns some results. Description A knight’s tour is a sequence of moves of a knight on aRead more

So i have a modified knight’s tour problem. The problem is the following , is there an algorithm that can give you the route(if possible the shortest) from (1,1) to (n,m) in a chessboard of the knight piece? And also if some blocks are blocked Eg. i have 3×5 chessboard and the blocks (2,3) andRead more