Nicht angemeldet. · Kennwort vergessen · Registrieren

Mitglied seit 10/2018
15 Beiträge
Betreff: Exam 13.02.2017 Task 2.4
Dear tutors,

in the exam from 13.02.2017, Task 2.4, we need to reorder the nodes in such a way that alpha-beta pruning prunes as many branches as possible.

I see a pattern there that leaf values are ordered in descending order, but actually the number of pruned nodes does not change as long as you put C left-most. Only the nodes that are pruned changes.

Just to make sure, is there some deeper meaning behind this ordering in descending order or are any solutions that lead to the maximum number of pruned subnodes valid?

Thank you and kind regards,
Mitglied seit 11/2016
14 Beiträge
If you want to be safe, you do it like that, but there can of course be other valid solutions. The only goal is to prune as much as possible and numbers don't care about what they stand for.
Schließen Kleiner – Größer + Auf diesen Beitrag antworten:
Prüfcode: VeriCode Gib bitte das Wort aus dem Bild ins folgende Textfeld ein. (Nur die Buchstaben eingeben, Kleinschreibung ist in Ordnung.)
Smileys: :-) ;-) :-D :-p :blush: :cool: :rolleyes: :huh: :-/ <_< :-( :'( :#: :scared: 8-( :nuts: :-O
Weitere Zeichen:
Gehe zu Forum
Datenschutz | Kontakt
Powered by the Unclassified NewsBoard software, 20150713-dev, © 2003-2011 by Yves Goergen