Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: For some two-player games (e.g. Go), no accurate and inexpensive heuristic is known for evaluating leaves of a search tree. For other games (e.g. chess), a heuristic is known (sum of piece values). For other games (e.g. Hex), only a local heuristic - one that compares children reliably, but non-siblings poorly - is known (cell voltage drop in the Shannon/Anshelevich electric circuit model).   introduce a search algorithm for a two-player perfect information game with a reasonable local heuristic.Sibling Conspiracy Number Search (SCNS) is an anytime best-first version of Conspiracy Number Search based not on evaluation of leaf states of the search tree, but - for each node - on relative evaluation scores of all children of that node. SCNS refines CNS search value intervals, converging to Proof Number Search. SCNS is a good framework for a game player. tested SCNS in the domain of Hex, with promising results.  implemented an 11-by-11 SCNS Hex bot, DeepHex.  competed DeepHex against current Hex bot champion MoHex, a Monte Carlo Tree Search player, and previous Hex bot champion Wolve, an Alpha-Beta Search player. DeepHex widely outperforms Wolve at all time levels, and narrowly outperforms MoHex once time reaches 4 min/move. tested the strength of SCNS features: most critical is to initialize leaves via a multi-step process. Also,  show a simple parallel version of SCNS: it scales ll for 2 threads but less efficiently for 4 or 8 threads.
['Jakub Pawlewicz', 'Ryan B. Hayward']
I am writing a research paper on a idea Conspiracy number search with relative sibling scores
[{"from": "human", "value": "I am writing a research paper on a idea Conspiracy number search with relative sibling scores"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: For some two-player games (e.g. Go), no accurate and inexpensive heuristic is known for evaluating leaves of a search tree. For other games (e.g. chess), a heuristic is known (sum of piece values). For other games (e.g. Hex), only a local heuristic - one that compares children reliably, but non-siblings poorly - is known (cell voltage drop in the Shannon/Anshelevich electric circuit model).   introduce a search algorithm for a two-player perfect information game with a reasonable local heuristic.Sibling Conspiracy Number Search (SCNS) is an anytime best-first version of Conspiracy Number Search based not on evaluation of leaf states of the search tree, but - for each node - on relative evaluation scores of all children of that node. SCNS refines CNS search value intervals, converging to Proof Number Search. SCNS is a good framework for a game player. tested SCNS in the domain of Hex, with promising results.  implemented an 11-by-11 SCNS Hex bot, DeepHex.  competed DeepHex against current Hex bot champion MoHex, a Monte Carlo Tree Search player, and previous Hex bot champion Wolve, an Alpha-Beta Search player. DeepHex widely outperforms Wolve at all time levels, and narrowly outperforms MoHex once time reaches 4 min/move. tested the strength of SCNS features: most critical is to initialize leaves via a multi-step process. Also,  show a simple parallel version of SCNS: it scales ll for 2 threads but less efficiently for 4 or 8 threads."}]