X

PVS meaning in Softwares ?

( 5 )  .  1 Rating
1503 views   .  0 comments  .   . 

Download Solution PDF

Answer: What is Principal Variation Search mean?

Principal variation search (sometimes equated with the practically identical NegaScout) is a negamax algorithm that can be faster than alpha-beta pruning. Like alpha-beta pruning, NegaScout is a directional search algorithm for computing the minimax value of a node in a tree. It dominates alpha-beta pruning in the sense that it will never examine a node that can be pruned by alpha-beta; however, it relies on accurate node ordering to capitalize on this advantage.

NegaScout works best when there is a good move ordering. In practice, the move ordering is often determined by previous shallower searches. It produces more cutoffs than alpha-beta by assuming that the first explored node is the best. In other words, it supposes the first node is in the principal variation. Then, it can check whether that is true by searching the remaining nodes with a null window (also known as a scout window; when alpha and beta are equal), which is faster than searching with the regular alpha-beta window. If the proof fails, then the first node was not in the principal variation, and the search continues as normal alpha-beta. Hence, NegaScout works best when the move ordering is good. With a random move ordering, NegaScout will take more time than regular alpha-beta; although it will not explore any nodes alpha-beta did not, it will have to re-search many nodes.

Alexander Reinefeld invented NegaScout several decades after the invention of alpha-beta pruning. He gives a proof of correctness of NegaScout in his book.

Another search algorithm called SSS* can theoretically result in fewer nodes searched. However, its original formulation has practical issues (in particular, it relies heavily on an OPEN list for storage) and nowadays most chess engines still use a form of NegaScout in their search. Most chess engines use a transposition table in which the relevant part of the search tree is stored. This part of the tree has the same size as SSS*'s OPEN list would have. A reformulation called MT-SSS* allowed it to be implemented as a series of null window calls to Alpha-Beta (or NegaScout) that use a transposition table, and direct comparisons using game playing programs could be made. It did not outperform NegaScout in practice. Yet another search algorithm, which does tend to do better than NegaScout in practice, is the best-first algorithm called MTD(f), although neither algorithm dominates the other. There are trees in which NegaScout searches fewer nodes than SSS* or MTD(f) and vice versa.

NegaScout takes after SCOUT, invented by Judea Pearl in 1980, which was the first algorithm to outperform alpha-beta and to be proven asymptotically optimal. Null windows, with β=α+1 in a negamax setting, were invented independently by J.P. Fishburn and used in an algorithm similar to SCOUT in an appendix to his Ph.D. thesis, in a parallel alpha-beta algorithm, and on the last subtree of a search tree root node.

reference
Full Form Category
Pre Vinylite Society Academic & Science
Provideniya Airport Code
Power Vent Surface Business
Passport and Visa Specialists Business
Premier Vehicle Services Business
Pro-Vet Supplies Business
Pojoaque Valley Schools Community
Palm Valley School Community
Prisoner Visitation and Support Community
Passive Vulnerability Scanner Computer Hardware
Passive Vision System Computer Hardware
Personal Video Station Computer Hardware
Proxied Volumes Computing
Parallel Visualization Server Computing
Physical Volumes Computing
Persistency Values Computing
Primary Virtual Source Computing
Prototype Verification System Computing
Potentially Visible Sets Computing
Principle Variation Search Earth Science
Physical Volcanology Section Earth Science
Pahrump Valley Speedway General
Product Verification Specification General
Plant Vehicle Scheduling General
Performance Vauxhall Show General
Prescott Vette Sette General
Plymouth Valiant Scamp General
Pet Vaccination Services General
Potential Visibility Set General
Perimeter Venting System General
Patch Verification System General
Partner Vetting System General
Promotional Video System General
Parachute Vortex Shedding General
Physical Verification System General
Passive Vision Sight General
Primary Village South General
Prototype Veriication System General
People Verification System General
Pulmonary Vein Stenosis General
Ported Vacuum Switch General
Passenger Vehicles General
Private Vehicles General
Panel Van with Windows and Seats General
Police Vehicles General
Pursuit Vehicle Storage General
Polynesian Voyaging Society General
Postal Vehicle Service General
Personal Vehicle System General
Project Vote Smart Governmental
Piston Valve Shock Governmental
Passaic Valley Sewerage Governmental
Potentially Visible Set Maths
Poultry Veterinary and Shrimp Medical
Post Viral Syndrome Medical
Persistent Vegetative State Medical
Pig Veterinary Society Medical
Permanent Vegetative State Medical
Polio Viruses Medical
Pecos Valley Southern Railway Company Regional
Pascoe Vale South, Victoria, Australia Regional
Pecos Valley Southern Railway Regional
Provideniya, Siberia, Russia Regional
Principal Variation Search Softwares
Potomac Valley Swimming Sports
Pennisula Video Surveillance Telecommunication

Take Quiz To Earn Credits!

Turn Your Knowledge into Earnings.




Give Rating
Report
Write Your Comments or Explanations to Help Others
Comments(0)





Miscellaneous in Softwares
Miscellaneous in Softwares

Ever curious about what that abbreviation stands for? fullforms has got them all listed out for you to explore. Simply,Choose a subject/topic and get started on a self-paced learning journey in a world of fullforms.

Explore Other Libraries

X

Important Softwares Links





Copyright (c) 2021 TuteeHUB

OPEN APP
Channel Join Group Join