## Search found 89 matches

- Sun Oct 11, 2020 3:11 am
- Forum: Computer Chess Club: Programming and Technical Discussions
- Topic: First success with neural nets
- Replies:
**19** - Views:
**2782**

### Re: First success with neural nets

The basic idea of NNUE is to use an absurdly huge first layer, almost all of the inputs of which are 0, and incremental updates to make that fast. So if you are using a fairly small first layer(and you are) then you are not using the NNUE idea.

- Fri Sep 18, 2020 4:41 am
- Forum: Computer Chess Club: General Topics
- Topic: Basic Search Question
- Replies:
**7** - Views:
**877**

### Re: Basic Search Question

alpha-beta can get your average branching factor down to around 6-8 with great move ordering, since it alternates trying all moves at one depth with trying just the one move needed to refute that move at the next depth. And since it only discards moves that are proven to not affect the final score i...

- Wed Sep 02, 2020 1:56 am
- Forum: Computer Chess Club: General Topics
- Topic: Short Article With Complete NN Chess Training Procedure
- Replies:
**1** - Views:
**676**

### Re: Short Article With Complete NN Chess Training Procedure

That is some seriously horrific code. And the basic idea(trying to have the network predict a move directly in algebraic notation using three outputs, x, y, and piece type) is pretty terrible also. One part that really sticks out as do-not-copy is where he tried to one-hot encode the column with a=n...

- Tue Sep 01, 2020 5:21 am
- Forum: Computer Chess Club: General Topics
- Topic: Chess solved?
- Replies:
**265** - Views:
**27406**

### Re: Chess solved?

So the TCS way is to look at the complexity of NxN chess. The problem is to solve an arbitrary position in NxN chess by a method that is not exponential in N. But it was shown decades ago that this cannot be done. If we could solve NxN chess with a method that IS exponential in N, that would be an ...

- Tue Sep 01, 2020 12:07 am
- Forum: Computer Chess Club: General Topics
- Topic: Chess solved?
- Replies:
**265** - Views:
**27406**

### Re: Chess solved?

But even 4k3/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQ - 0 1 is not trivial to prove, although looking at a few lines, it looks like it could be done in a day or so. Just a followup on this, I left 1 core of my computer running on this while I did other stuff, and(not too surprisingly) this is proven...

- Sun Aug 30, 2020 6:03 am
- Forum: Computer Chess Club: General Topics
- Topic: Chess solved?
- Replies:
**265** - Views:
**27406**

### Re: Chess solved?

I have wasted a fair amount of cpu time trying to prove that giving queen odds is a forced loss. So what can you prove is a forced loss, Queen + rook, Queen + 2 rooks ? I haven't bothered to search much on more extreme odds. But even 4k3/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQ - 0 1 is not trivial ...

- Wed Aug 26, 2020 5:25 am
- Forum: Computer Chess Club: General Topics
- Topic: Chess solved?
- Replies:
**265** - Views:
**27406**

### Re: Chess solved?

Imagine if you had a million GPUs cooperating in an AND/OR proof search. You could generate 1 million openings from the starting position for which evals of SF, LC0, and Komodo are between -1 and 1 at the leaf nodes. Choose a few at random and try to solve them using this method. If you can solve t...

- Thu Jun 25, 2020 5:45 am
- Forum: Computer Chess Club: Programming and Technical Discussions
- Topic: Chess varinat engine questions
- Replies:
**6** - Views:
**2069**

### Re: Chess varinat engine questions

2) And the risk of hash collisions should only be affected by speed and number of hash table entries, not number of piece types. At least if you do it right. Just have an array of random 64 bit numbers indexed by piece type and location on the board, so as you get more piece types your array gets bi...

- Thu Jun 25, 2020 3:21 am
- Forum: Computer Chess Club: Programming and Technical Discussions
- Topic: Chess varinat engine questions
- Replies:
**6** - Views:
**2069**

### Re: Chess varinat engine questions

One method to get an in-between strength is to do a shallow search with a wide window, then pick at random from the moves that score within that window. Like if your windows is 20 centpawns, and you search 4 ply deep and get a score of 50, then search all moves with a window of 30 to 50, and any mov...

- Mon May 04, 2020 4:51 am
- Forum: Computer Chess Club: General Topics
- Topic: Komodo vs. GM Lenderman match; "Almost a knight"
- Replies:
**98** - Views:
**13694**

### Re: Komodo vs. GM Lenderman match; "Almost a knight"

It seems to me that an "obvious" way to handle these odds games would be to have the computer scale the value of it's pieces up until the initial position scores as 0.0. That way the further behind it starts, the less willing it will be to trade pieces.