First, Nick Bostrom has an example where a Riemann hypothesis solving machine converts the earth into computronium. I imagine he’d predict the same for a chess program, regardless of what ontology it uses.
Second, if instrumental convergence was that easy to solve (the convergence in the domain of chess is harmless), it wouldn’t really be an interesting problem.
First, Nick Bostrom has an example where a Riemann hypothesis solving machine converts the earth into computronium. I imagine he’d predict the same for a chess program, regardless of what ontology it uses.
Second, if instrumental convergence was that easy to solve (the convergence in the domain of chess is harmless), it wouldn’t really be an interesting problem.