this is an experimental idea I was thinking of implementing in my chess engine. I've revised the concept a couple times over a few months but not as well as I want to articulate it.
Sphere Search Idea
- Use digits of pi as a deterministic pseudo-random stream to guide exploration.
- Treat move exploration as an expanding sphere of possibilities. // i don't know how to really explain this
- Use sphere radius to control breadth/depth of sampled lines.
- Aim to index more scenarios (MCTS-like coverage) while keeping deterministic reproducibility.
thoughts and comments would be appreciated!
search algo using digits of pi
Moderator: Ras
-
rsunil
- Posts: 1
- Joined: Fri Aug 14, 2026 7:37 am
- Full name: Rishon Sunil
-
p1x3r
- Posts: 12
- Joined: Fri Jan 09, 2026 9:29 pm
- Location: Cesar, Colombia
- Full name: Jesús España
Re: search algo using digits of pi
An idea so weird it's worth exploring. I've got 2 things to say:
1. How are you going to use the digits of pi to guide search?, are you just going to seed a PRNG algorithm like Xoshiro-256 with the digits of pi or what?
2. I don't understand exactly what are you talking about when you say "Treat move exploration as an expanding sphere of possibilities". I mean, the idea would probably just collapse to a regular tree-search like MCTS or Negamax if I understand what you're saying (which it seems like I don't). So give it some thought and try to better explain it.
1. How are you going to use the digits of pi to guide search?, are you just going to seed a PRNG algorithm like Xoshiro-256 with the digits of pi or what?
2. I don't understand exactly what are you talking about when you say "Treat move exploration as an expanding sphere of possibilities". I mean, the idea would probably just collapse to a regular tree-search like MCTS or Negamax if I understand what you're saying (which it seems like I don't). So give it some thought and try to better explain it.