ChanServ changed the topic of #picolisp to: PicoLisp language | Channel Log: https://irclog.whitequark.org/picolisp/ | Check also http://www.picolisp.com for more information
ubLIX has quit [Quit: ubLIX]
orivej has joined #picolisp
<razzy> i can execute your Regenaxer parael game function in chess.l . but i cannot debug (!) it in any reasonable way. nor i can (pretty ) print from it. it makes SIG errors. how do you look what it does?
<Regenaxer> Hi razzy
<Regenaxer> Hmm, probably cause all processes are on the same tty
<razzy> Hi :] all
<razzy> uff, painfull
<Regenaxer> :)
<Regenaxer> Somehow '*Dbg' switched on in only one process?
<Regenaxer> Or config it in such a way that only a single process goes "parallel"?
<razzy> if i could config it, i would not need to debug it to reason about it :/
<Regenaxer> true, it simply dispatches processes in the first ply
<Regenaxer> The SMP flag
<Regenaxer> I think this parallel version is not useful, as the processes compute rather redundantly the same stuff
<Regenaxer> The problem is *how* to distribute the search in a clever way to all the processes
<razzy> Regenaxer: i agree it is mostly not usefull for picochess player. but i hoped it makes subprocess for every move on starting board so i could read out all moves rated with my cost function for analysis
<Regenaxer> ok
<razzy> to distribute search on all cores is imho hopeless from top-down aproach as you demostrated. too much overhead. too much redundant stuff
<razzy> i cannot see simple, powerfull way
<Regenaxer> yeah
<Regenaxer> Perhaps paralellize on the bottom level. But there most moves are pruned off
<razzy> i can see simple, not easy, powerfull, way for bottom-up paraelisation
<razzy> one would be to build move-tree far ahead and paraelise and store cost evals and sub trees.
<razzy> which is completely different aproach
<razzy> than picochess use now
<Regenaxer> Perhaps, yes, but in this implementation the cost calculation is inexpensive compared to move generation
<razzy> second would be make picolisp paraelise processes automagically from lisp AST tree:]
<razzy> Regenaxer: btw, picochess cost function seem oversized and costly.
<razzy> and i still do not understand half of it :]
<Regenaxer> It is quite primitive, almost only material counting (with considering possible battles)
<razzy> and battles are pieces removal from board?
<razzy> not many moves ahead?
<Regenaxer> Many moves ahead, but only considering exchages
<Regenaxer> also "pinned" pieces which may attack another field but cannot move cause otherwise the king would be in check
<Regenaxer> queen too
<Regenaxer> I don't remember the details
<razzy> no problem, thx. i know what to look for.
<Regenaxer> :)
<razzy> *now i know
razzy has quit [Ping timeout: 244 seconds]
lodsw has quit [Ping timeout: 246 seconds]
lodsw has joined #picolisp
xkapastel has quit [Quit: Connection closed for inactivity]
groovy2shoes has joined #picolisp
libertas has quit [Ping timeout: 252 seconds]
libertas has joined #picolisp
libertas has quit [Ping timeout: 246 seconds]
libertas has joined #picolisp
libertas has quit [Ping timeout: 272 seconds]
libertas has joined #picolisp
libertas has quit [Ping timeout: 245 seconds]
libertas has joined #picolisp
pchrist has quit [Quit: leaving]
pchrist has joined #picolisp
razzy has joined #picolisp
razzy has quit [Ping timeout: 268 seconds]
alexshendi has quit [Read error: Connection reset by peer]
xkapastel has joined #picolisp
orivej has quit [Ping timeout: 268 seconds]
orivej has joined #picolisp
alexshendi has joined #picolisp
alexshendi has quit [Ping timeout: 245 seconds]
razzy has joined #picolisp
alexshendi has joined #picolisp
alexshendi has quit [Read error: Connection reset by peer]
alexshendi has joined #picolisp
orivej has quit [Ping timeout: 272 seconds]
alexshendi has quit [Read error: Connection reset by peer]
ubLIX has joined #picolisp
orivej has joined #picolisp
libertas has quit [Ping timeout: 250 seconds]
libertas has joined #picolisp