On Thu, Dec 21, 2017 at 3:40 PM, Bill wrote:
> Steve D'Aprano wrote:
>>
>> On Thu, 21 Dec 2017 08:37 am, Bill wrote:
>>
>>> namenobodywa...@gmail.com wrote:
On Tuesday, December 19, 2017 at 3:28:39 PM UTC-8, Steve D'Aprano wrote:
> Does this have anything specifically to do with
Steve D'Aprano wrote:
On Thu, 21 Dec 2017 08:37 am, Bill wrote:
namenobodywa...@gmail.com wrote:
On Tuesday, December 19, 2017 at 3:28:39 PM UTC-8, Steve D'Aprano wrote:
Does this have anything specifically to do with Python programming?
i'm working on a game-playing script (ie: in python),
On Thu, 21 Dec 2017 08:37 am, Bill wrote:
> namenobodywa...@gmail.com wrote:
>> On Tuesday, December 19, 2017 at 3:28:39 PM UTC-8, Steve D'Aprano wrote:
>>
>>> Does this have anything specifically to do with Python programming?
>> i'm working on a game-playing script (ie: in python), i want to inc
namenobodywa...@gmail.com wrote:
On Tuesday, December 19, 2017 at 3:28:39 PM UTC-8, Steve D'Aprano wrote:
Does this have anything specifically to do with Python programming?
i'm working on a game-playing script (ie: in python), i want to incorporate
pruning into my search algorithm, and i'd l
On Tuesday, December 19, 2017 at 5:34:17 PM UTC-8, Paul Rubin wrote:
> It frankly sounds like homework.
https://en.wikipedia.org/wiki/Theorem
--
https://mail.python.org/mailman/listinfo/python-list
On Tuesday, December 19, 2017 at 3:28:39 PM UTC-8, Steve D'Aprano wrote:
> Does this have anything specifically to do with Python programming?
i'm working on a game-playing script (ie: in python), i want to incorporate
pruning into my search algorithm, and i'd like to understand why it works; i'
On Wed, 20 Dec 2017 07:23 am, namenobodywa...@gmail.com wrote:
> On Monday, December 18, 2017 at 10:16:07 PM UTC-8, Terry Reedy wrote:
>
>> Where or how have you looked so far? How formal do you want?
>
> i want full-on formal with lots of rigor and every possible detail spelled
> out; i've loo
On Monday, December 18, 2017 at 10:16:07 PM UTC-8, Terry Reedy wrote:
> Where or how have you looked so far? How formal do you want?
i want full-on formal with lots of rigor and every possible detail spelled out;
i've looked in a couple of books but my best lead so far is a paper by knuth
call
On 12/19/2017 1:01 AM, namenobodywa...@gmail.com wrote:
can anybody tell me where to look for a proof of the correctness of a
minimax/negamax algorithm with alpha-beta pruning? thanks if you can help
Where or how have you looked so far? How formal do you want?
--
Terry Jan Reedy
--
https:/
hi all
can anybody tell me where to look for a proof of the correctness of a
minimax/negamax algorithm with alpha-beta pruning? thanks if you can help
peace
stm
--
https://mail.python.org/mailman/listinfo/python-list
10 matches
Mail list logo
