HellMood information 4385 glöps
- general:
- level: user
- personal:
- portals:
- demozoo: profile
- cdcs:
- cdc #1: Crystal Dream 2 by Triton
- cdc #2: Hydrokinetics by Prismbeings
- cdc #3: Overdrive 2 by Titan [web]
- cdc #4: Way Too Rude by Logicoma [web] & Loonies [web]
- cdc #5: There by Still [web]
- cdc #6: Hexer by LJ
- cdc #7: Second Nature by Desire [web] & The Twitch Elite
- demo Commodore 64 Multicolor Twister by DnP
- happy little twister ^^
- rulezadded on the 2015-01-28 20:47:32
- demo Atari STe Baby, instant soup doesn't really grab me by KÜA software productions & Reservoir Gods [web]
- made me laugh :) lovely!
- rulezadded on the 2015-01-28 20:44:59
- demo Atari XL/XE Near by Agenda
- the subway passage ♥
- rulezadded on the 2015-01-28 20:39:31
- 4k Atari VCS Monkey Obesity by Irrlicht Project [web] & XAYAX
- i can haz video plx? :P
- isokadded on the 2015-01-28 20:34:55
- invitation ZX Spectrum FOReVER 2015 invitation by Gemba Boys
- neat =)
- rulezadded on the 2015-01-28 20:34:14
- 512b game MS-Dos BootChess by Red Sector Inc. [web]
- @ham, yes, you would need to push and pop a lot ;) i think that's still better than any evaluation based approach. Better, in the meaning of : more suited for a sizetro. Evaluation means formulas, or tables, or both, in the code (!) A sizetro has no space for that. But it can use 640K of memory. While normally, nobody in the current chess coding scene will route for the MC approach right now, it might make perfect sense for a sizetro.
I guess, we will never know unless somebody actually tries ;) - isokadded on the 2015-01-27 22:53:46
- 512b game MS-Dos BootChess by Red Sector Inc. [web]
- I'd give the Monte Carlo approach a try.
https://chessprogramming.wikispaces.com/Monte-Carlo+Tree+Search
Basically, just play repeatedly random games until the end from the current position, and chose the move which scores best on average. No sophisticated evaluation needed here, not even memory (besides the one currently simulated variant). Just a score per each possible move, which is updated after each run. After some (thousands?) of these runs, chose the most promising move ;) - isokadded on the 2015-01-27 22:23:33
- 512b game MS-Dos BootChess by Red Sector Inc. [web]
- Quote:
I'd advise to change the opening move to e2e3 (passive) or (solid) both prevent the basic scholars mate idea).
... or d2d4 (solid) ^^ - isokadded on the 2015-01-27 21:24:17
- 512b game MS-Dos BootChess by Red Sector Inc. [web]
- Observations by ham are correct. This behaviour is desribed in the readme though ;) The program is expoitable really fast by some kind of reversed scholars mate :/
1. e2e4 e7e5
2. Ng1e2 Bf8c5
3. Nb1c3 Qd8h4
4. h2h3 Qh4xf2 (mate)
5. Ke1xf2 Bc5xf2 (exits)
I'd advise to change the opening move to e2e3 (passive) or (solid) both prevent the basic scholars mate idea).
Basically i'm d'accord with everything ham said. Just i think that this is awesome anyway ;)
Some links for interested people :
http://talkchess.com/forum/index.php
http://tcec.chessdom.com/live.php
http://stockfishchess.org/
http://www.computerchess.org.uk/ccrl/4040/
https://groups.google.com/forum/#!forum/fishcooking
https://chessprogramming.wikispaces.com/ - isokadded on the 2015-01-27 21:22:44
- 512b game MS-Dos BootChess by Red Sector Inc. [web]
- I just started a quick game :D After 1.e4 e6 2.Ne2 d5 3.exd exd 4.Nc3 c6 5.Nxd5? cxd5 6.h3 i am already sure i'll win this, but hey, i am a club level chess player ;) Will dive deep into the code later, for now i'll just say : WOW! Great release!
- rulezadded on the 2015-01-27 02:28:20
account created on the 2013-10-21 16:56:56
