–

I never solved Rubik’s cube even once the right way

. Most I could get is two sides. But as I kid I knew how to take it apart so…

I tried sodoku about 10 years ago. I kind of liked it up to a point but after that it was too hard, but I tried it Crossword puzzles I could never do well. Takes a lot of patience and all I can think is, “It’s just a game, stop trying” and I’d stop. But pickup sticks I could do. Jenga too. Same kind of thing.

—-

Oh this is interesting: A ‘pick-up sticks’ template for a Neural network to try to identify unknown cunieforms. While not what I was looking for, an amazing idea. Wonder if it’s stil

l in use? “Makido Algorithm” shows up here and there. Looks like this MIGHT be the source from 1996

It’s 23 yr old AI but I like it. I’ll have to see if it’s changed names.

====

“As a consequence, every simple dual braid in every spherical type Artin group is a Mikado

braid, the reduction to the irreducible case being immediate.”

the reduction to the irreducible case being immediate.

ie – pick-up sticks is hard

====

I dunno what this is but these folks seem pretty proud of their

work. Now I gotta learn a thing I think?

“We show that the simple elements of the dual Garside structure of an Artin group of type D n are Mikado braids, giving a positive answer to a conjecture of Digne and the second author. To this end, we use an embedding of the Artin group of type D n in a suitable quotient of an Artin group of type B n noted by Allcock, of which we give a simple algebraic proof here. This allows one to give a characterization of the Mikado braids of type D n in terms of those of type B n and also to describe them topologically. Using this topological representation and Athanasiadis and Reiner’s model for noncrossing partitions of type D n whic

h can be used to represent the simple elements, we deduce the above‐mentioned conjecture.”

===

——

====

What it’s showing by not touching is that you CAN always remove a pickup stick – at SOME point in the game. But each graph you make will be irreducable – that is – you need a new map every time.

====

https://www.nature.com/articles/nphys3628…