We can easily build objectives for chess search trees, because: the complete state of the world is represented by a type known at compile-time; and we can handwrite a function to say exactly what states of the world we want, as described by that known representation. An AGI

→ View original post on X — @esyudkowsky,