What is generally accepted as being the first machine implementation of a search tree (as they are more commonly known and used in modern computing for things like solving or powering, mazes, checkers, chess, tic-tac-toe, etc.)?
Early maze solving robots/machines, some of them may have been based on right or left hand rule, and depth search.
The first machines that played board games, since obviously each square of the board would have been a permanent part of the machine. (a permanent search tree).
Obviously, very few of the first maze solvers would have stored the maze, or what they had so far mapped of the maze, however, I suspect that the robot arm built by 'Thomas Ross' in 1933, at the 'University of Washington' would have, it used a type of electromechanical memory .
Here's a link to what seem to be the first maze solvers, 'Thomas Ross', at the 'University of Washington', built some (how many?) at that time.
I re worded this question, by using the suggestion in the comment below, so I just copied the text in that comment "the first machine implementation of a search tree", to be the question.
Note - I have not actually made it a requisite that the tree or part of it be stored, I just left that undecided to allow 'interesting' other designs to be posted. My unavoidable error is in mentioning storage of the search-tree or how much of it had been generated so far. To make this question truly correct, maybe I should make it a requisite that the search-tree or how much of it had been generated so far, be stored. I think it's wiser to leave it as it is, unless it makes this question too badly asked.